Publication:4281260
From MaRDI portal
zbMath0823.03022MaRDI QIDQ4281260
Publication date: 10 March 1994
denotation; formal language of recursion; algorithm for computing a truth-value; decision algorithm for equations of partially defined terms; intensional identity of sentences; sense of a first-order sentence
03A05: Philosophical and critical aspects of logic and foundations
03B25: Decidability of theories and sets of sentences
03D75: Abstract and axiomatic computability and recursion theory
Related Items
Situations as Strings, THE SENSE/REFERENCE DISTINCTION IN CONSTRUCTIVE SEMANTICS, Axiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic Semantics, Predicativity, the Russell-Myhill paradox, and Church's intensional logic, Gnosis, The paradox of inference and the non-triviality of analytic information, Situations in LTL as strings, Book review of: Jens Erik Fenstad, Grammar, geometry and brain, Book review of: Răzvan Diaconescu, Institution-independent model theory, If structured propositions are logical procedures then how are procedures individuated?, The IO and OI hierarchies revisited, A proof-theoretic view of necessity, Extensional Logic of Hyperintensions