Sökning: "Constructive theory"
Visar resultat 11 - 15 av 102 avhandlingar innehållade orden Constructive theory.
11. A Natural Interpretation of Classical Proofs
Sammanfattning : In this thesis we use the syntactic-semantic method of constructive type theory to give meaning to classical logic, in particular Gentzen's LK.We interpret a derivation of a classical sequent as a derivation of a contradiction from the assumptions that the antecedent formulas are true and that the succedent formulas are false, where the concepts of truth and falsity are taken to conform to the corresponding constructive concepts, using function types to encode falsity. LÄS MER
12. Achieving completeness: from constructive set theory to large cardinals
Sammanfattning : This thesis is an exploration of several completeness phenomena, both in the constructive and the classical settings. After some introductory chapters in the first part of the thesis where we outline the background used later on, the constructive part contains a categorical formulation of several constructive completeness theorems available in the literature, but presented here in an unified framework. LÄS MER
13. Towards a Theory of Codes for Iterative Decoding
Sammanfattning : Channel codes in combination with iterative decoding techniques are a both powerful and efficient method to protect data against disturbances in digital communication systems. This thesis deals with various code constructions for block-wise and continuous transmission that have the potential to achieve low bit error rates with iterative decoding, even when operating close to the Shannon limit. LÄS MER
14. Contributions to Pointfree Topology and Apartness Spaces
Sammanfattning : The work in this thesis contains some contributions to constructive point-free topology and the theory of apartness spaces. The first two papers deal with constructive domain theory using formal topology. LÄS MER
15. General Recursion in Type Theory
Sammanfattning : This thesis deals with the use of constructive type theory as a programming language. In particular, it presents a method to translate general recursive functional programs into their type-theoretic equivalents. A key notion in functional programming is recursion, which allows that the object being defined refers to itself. LÄS MER