Completeness in the theory of types
From MaRDI portal
Publication:5798021
DOI10.2307/2266967zbMath0039.00801OpenAlexW2160331299WikidataQ55881115 ScholiaQ55881115MaRDI QIDQ5798021
Publication date: 1950
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2266967
Related Items (only showing first 100 items - show all)
Typed equivalence, type assignment, and type containment ⋮ Right and Left Mappings in Equality Algebras ⋮ On Languages Which are Based on Non-Standard Arithmetic ⋮ A Non-Standard Truth Definition ⋮ Automating Leibniz’s Theory of Concepts ⋮ Rewriting, and equational unification: the higher-order cases ⋮ Leon Henkin and a Life of Service ⋮ A Bit of History Related to Logic Based on Equality ⋮ Leon Henkin the Reviewer ⋮ Henkin on Completeness ⋮ The Countable Henkin Principle ⋮ From Classical to Fuzzy Type Theory ⋮ April the 19th ⋮ Henkin and Hybrid Logic ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Strong Logics of First and Second Order ⋮ Lewisian Naturalness and a new Sceptical Challenge ⋮ A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic ⋮ Identity, Equality, Nameability and Completeness ⋮ Simple type theory of Gentzen style with the inference of extensionality ⋮ Unnamed Item ⋮ Propositional forms of judgemental interpretations ⋮ On the algebraization of Henkin‐type second‐order logic ⋮ An axiom system for basic hybrid logic with propositional quantifiers ⋮ Solving modal logic problems by translation to higher-order logic ⋮ Completeness of cut-free type theories ⋮ Second-Order Logic and Foundations of Mathematics ⋮ DISTANCES BETWEEN FORMAL THEORIES ⋮ Leśniewski and Russell's Paradox: Some Problems ⋮ THF0 – The Core of the TPTP Language for Higher-Order Logic ⋮ Unnamed Item ⋮ Identity, equality, nameability and completeness. Part II ⋮ Life on the Range: Quine’s Thesis and Semantic Indeterminacy ⋮ What’s So Bad About Second-Order Logic? ⋮ From Pictures to Semantical Games: Hintikka’s Journey Through Semantic Representationalism ⋮ The Discovery of My Completeness Proofs ⋮ Higher-Order Tarski Grothendieck as a Foundation for Formal Proof. ⋮ A logical framework combining model and proof theory ⋮ R n - and G n -logics ⋮ A relational formulation of the theory of types ⋮ ON THE GENERAL INTERPRETATION OF FIRST-ORDER QUANTIFIERS ⋮ Alonzo church:his life, his work and some of his miracles ⋮ LOGIC IN THE TRACTATUS ⋮ Classifying spaces for toposes with enough points ⋮ Topologies of Closed Subsets ⋮ Analytic Tableaux for Higher-Order Logic with Choice ⋮ Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees ⋮ Completeness of type assignment systems with intersection, union, and type quantifiers ⋮ Superposition with lambdas ⋮ Making higher-order superposition work ⋮ Superposition with lambdas ⋮ Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic ⋮ Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent ⋮ Kripke Semantics for Martin-Löf’s Extensional Type Theory ⋮ In Memoriam: Leon Albert Henkin 1921–2006 ⋮ Leon Henkin ⋮ Remark on complete interpretations by models ⋮ Model Theory for the Higher Order Predicate Calculus ⋮ Notes on the theory of variable binding term operators ⋮ All Properties are Divine or God Exists - The Sacred Thesis and its Ontological Argument ⋮ Sheaf Representations and Duality in Logic ⋮ The compactness of first-order logic:from gödel to lindström ⋮ Truth Definitions and Consistency Proofs ⋮ Frege's double correlation thesis and Quine's set theories NF and ML ⋮ Non-standard algorithmic and dynamic logic ⋮ Completeness and decidability of general first-order logic (with a detour through the guarded fragment) ⋮ Cut-elimination for quantified conditional logic ⋮ On definitions of constants and types in HOL ⋮ Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation ⋮ From IF to BI. A tale of dependence and separation ⋮ The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus ⋮ Schrödinger logics ⋮ Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic ⋮ A formal theory of intermediate quantifiers ⋮ Pecularities of some three- and four-valued second order logics ⋮ The broadest necessity ⋮ Second-order logic of paradox ⋮ Probabilistic modelling, inference and learning using logical theories ⋮ A semantics for \(\lambda \)Prolog ⋮ An admissible semantics for propositionally quantified relevant logics ⋮ A `natural logic' inference system using the Lambek calculus ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus ⋮ Dynamic squares ⋮ Polymorphic type inference and containment ⋮ Independence-friendly logic and axiomatic set theory ⋮ Elementary categorial logic, predicates of variable degree, and theory of quantity ⋮ Using tactics to reformulate formulae for resolution theorem proving ⋮ Propositional quantification in the topological semantics for \(\mathbf S4\) ⋮ Extensional higher-order paramodulation in Leo-III ⋮ Syntax and semantics of the logic \({\mathcal L}_{\omega\omega}^\lambda\) ⋮ Birkhoff style calculi for hybrid logics ⋮ Critical notice to: D. M. Gabbay's Investigations in modal and tense logics with applications to problems in philosophy and linguistics ⋮ From types to sets ⋮ Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. ⋮ Reasoning about mathematical fuzzy logic and its future ⋮ Quantified multimodal logics in simple type theory ⋮ Intuitionist type theory and foundations ⋮ General models and entailment semantics for independence logic ⋮ Higher-Order Modal Logics: Automation and Applications
This page was built for publication: Completeness in the theory of types
