Meaning and computing: two approaches to computable propositions
From MaRDI portal
Publication:2148782
DOI10.1007/978-3-030-88853-4_7OpenAlexW3204601955MaRDI QIDQ2148782FDOQ2148782
Authors: Ivo Pezlar 
Publication date: 24 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88853-4_7
Recommendations
constructive type theorytransparent intensional logicprocedural semanticsalgorithmic theory of meaningcomputable propositionsense-denotation distinction
Cites Work
- Untersuchungen über das logische Schliessen. I
- Meaning approached via proofs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A formulation of the simple theory of types
- Title not available (Why is that?)
- Procedural semantics for hyperintensional logic. Foundations and applications of transparent intensional logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Title not available (Why is that?)
- Information and knowledge. A constructive type-theoretical approach
- A constructive type-theoretical formalism for the interpretation of subatomically sensitive natural language constructions
- Functionality in Combinatory Logic
- Treatise on intuitionistic type theory
- Adjectival and adverbial modification: the view from modern type theories
- THE SENSE/REFERENCE DISTINCTION IN CONSTRUCTIVE SEMANTICS
- Intension in terms of Turing machines
- Conceptual and derivation systems
- Immanent reasoning or equality in action. A plaidoyer for the play level
- Algorithmic theories of problems. A constructive and a non-constructive approach
- Belief attitudes, fine-grained hyperintensionality and type-theoretic logic
- Title not available (Why is that?)
This page was built for publication: Meaning and computing: two approaches to computable propositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148782)
