Meaning and computing: two approaches to computable propositions

DOI10.1007/978-3-030-88853-4_7OpenAlexW3204601955MaRDI QIDQ2148782

Ivo Pezlar

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88853-4_7

zbMATH Keywords

constructive type theoryprocedural semanticstransparent intensional logicalgorithmic theory of meaningcomputable propositionsense-denotation distinction

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Treatise on intuitionistic type theory
• Adjectival and adverbial modification: the view from modern type theories
• A constructive type-theoretical formalism for the interpretation of subatomically sensitive natural language constructions
• Procedural semantics for hyperintensional logic. Foundations and applications of transparent intensional logic
• Immanent reasoning or equality in action. A plaidoyer for the play level
• Untersuchungen über das logische Schliessen. I
• Information and knowledge. A constructive type-theoretical approach
• Meaning approached via proofs
• Intension in terms of Turing machines
• Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach
• Functionality in Combinatory Logic
• THE SENSE/REFERENCE DISTINCTION IN CONSTRUCTIVE SEMANTICS
• Correspondence between ALGOL 60 and Church's Lambda-notation
• A formulation of the simple theory of types

This page was built for publication: Meaning and computing: two approaches to computable propositions