scientific article; zbMATH DE number 824731
From MaRDI portal
Publication:4858033
zbMath0848.03001MaRDI QIDQ4858033
Publication date: 11 December 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
modal logicdynamic logicsemanticssecond-order logictype theorydeductive systemsmany-sorted logicsecond-order Peano arithmeticsecond-order frames
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (37)
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic ⋮ Predicativity, the Russell-Myhill paradox, and Church's intensional logic ⋮ Expressing Polymorphic Types in a Many-Sorted Language ⋮ TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS ⋮ Henkin on Completeness ⋮ April the 19th ⋮ Henkin and Hybrid Logic ⋮ Changing a Semantics: Opportunism or Courage? ⋮ RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES ⋮ Steps toward a computational metaphysics ⋮ Identity, Equality, Nameability and Completeness ⋮ LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC ⋮ Ramsey equivalence ⋮ On the algebraization of Henkin‐type second‐order logic ⋮ Foundations of applied mathematics. I ⋮ Topologies on \(X\) as points within \(2^{{\mathcal P}(X)}\) ⋮ Quine's conjecture on many-sorted logic ⋮ Completeness, Categoricity and Imaginary Numbers: The Debate on Husserl ⋮ Some uses of logic in rigorous philosophy ⋮ Completeness in hybrid type theory ⋮ On Non-transitive “Identity” ⋮ Some Comments and Replies ⋮ Probabilities defined on standard and non-standard cylindric set algebras ⋮ Proof verification and proof discovery for relativity ⋮ The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself ⋮ AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING ⋮ Alonzo church:his life, his work and some of his miracles ⋮ MORITA EQUIVALENCE ⋮ Some new results on decidability for elementary algebra and geometry ⋮ Abstract deduction and inferential models for type theory ⋮ Completeness in equational hybrid propositional type theory ⋮ Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees ⋮ Non-standard stochastics with a first order algebraization ⋮ Using First-Order Theorem Provers in the Jahob Data Structure Verification System ⋮ Learning to assign degrees of belief in relational domains ⋮ IDENTITY AND INDISCERNIBILITY ⋮ Neo-Logicism and Its Logic
This page was built for publication:
