Sökning: "constructive semantics"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden constructive semantics.

1. 1. A Natural Interpretation of Classical Proofs

   Författare :Jens Brage; Per Martin-Löf; Sara Negri; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Brouwer-Heyting-Kolmogorov; classical logic; constructive type theory; constructive semantics; proof interpretation; double-negation; continuation-passing-style; natural deduction; sequent calculus; cut elimination; explicit substitution; Mathematical logic; Matematisk logik;

   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

3. 2. Computational Issues in Calculi of Partial Inductive Definitions

   Författare :Per Kreuger; RISE; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

   Sammanfattning : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. LÄS MER

4. 3. Generic distribution support for programming systems

   Författare :Erik Klintskog; Seif Haridi; Peter von Roy; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; computer sicence; Datavetenskap; Computer science; Datavetenskap;

   Sammanfattning : This dissertation provides constructive proof, through the implementation of a middleware, that distribution transparency is practical, generic, and extensible. Fault tolerant distributed services can be developed by using the failure detection abilities of the middleware. LÄS MER

5. 4. Content and Composition : An essay on tense, content, and semantic value

   Författare :Sara Packalén; Peter Pagin; Åsa Wikforss; Jeffrey King; Stockholms universitet; []
   Nyckelord :HUMANIORA; HUMANITIES; Semantic value; assertoric content; compositionality; tense; Kaplan; Lewis; communication; Theoretical Philosophy; teoretisk filosofi;

   Sammanfattning : A remarkable thing about natural language is that we can use it to share our beliefs and thoughts about the world with other speakers of our language. In cases of successful communication, beliefs seem to be transferred from speakers to hearers by means of the hearer recovering the contents of the speaker’s utterances. LÄS MER

7. 5. Cubical Intepretations of Type Theory

   Författare :Simon Huber; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependent Type Theory; Univalence Axiom; Models of Type Theory; Identity Types; Cubical Sets;

   Sammanfattning : The interpretation of types in intensional Martin-Löf type theory as spaces and their equalities as paths leads to a surprising new view on the identity type: not only are higher-dimensional equalities explained as homotopies, this view also is compatible with Voevodsky's univalence axiom which explains equality for type-theoretic universes as homotopy equivalences, and formally allows to identify isomorphic structures, a principle often informally used despite its incompatibility with set theory. While this interpretation in homotopy theory as well as the univalence axiom can be justified using a model of type theory in Kan simplicial sets, this model can, however, not be used to explain univalence computationally due to its inherent use of classical logic. LÄS MER