Meaning and computing: two approaches to computable propositions

DOI10.1007/978-3-030-88853-4_7MaRDI QIDQ2148782zbMATH OpenOpenAlexFDO

Authors 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 theorytransparent intensional logicprocedural semanticsalgorithmic theory of meaningcomputable propositionsense-denotation distinction

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• A computational meta-model of the reality and the problem of truth
• Natural language semantics and computability
• Predication and computable concepts
• Intensionality, definability and computation
• A minimal logical system for computable concepts and effective knowability

Cites work

• scientific article; zbMATH DE number 3910392 (Why is no real title available?)
• scientific article; zbMATH DE number 3692654 (Why is no real title available?)
• scientific article; zbMATH DE number 43055 (Why is no real title available?)
• scientific article; zbMATH DE number 50149 (Why is no real title available?)
• scientific article; zbMATH DE number 3508455 (Why is no real title available?)
• scientific article; zbMATH DE number 1028823 (Why is no real title available?)
• scientific article; zbMATH DE number 783772 (Why is no real title available?)
• scientific article; zbMATH DE number 7307096 (Why is no real title available?)
• A constructive type-theoretical formalism for the interpretation of subatomically sensitive natural language constructions
• A formulation of the simple theory of types
• Adjectival and adverbial modification: the view from modern type theories
• Algorithmic theories of problems. A constructive and a non-constructive approach
• Belief attitudes, fine-grained hyperintensionality and type-theoretic logic
• Conceptual and derivation systems
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Functionality in Combinatory Logic
• Immanent reasoning or equality in action. A plaidoyer for the play level
• Information and knowledge. A constructive type-theoretical approach
• Intension in terms of Turing machines
• Meaning approached via proofs
• Procedural semantics for hyperintensional logic. Foundations and applications of transparent intensional logic
• THE SENSE/REFERENCE DISTINCTION IN CONSTRUCTIVE SEMANTICS
• Treatise on intuitionistic type theory
• Untersuchungen über das logische Schliessen. I

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)