The completeness of the first-order functional calculus
From MaRDI portal
Publication:5791200
DOI10.2307/2267044zbMath0034.00602OpenAlexW2090190027WikidataQ56235382 ScholiaQ56235382MaRDI QIDQ5791200
Publication date: 1949
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2267044
Related Items (only showing first 100 items - show all)
Abstract categorical logic ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Ranks, spectra and their dynamics for families of constant expansions of theories ⋮ A completeness proof for a regular predicate logic with undefined truth value ⋮ Current trends in substructural logics ⋮ A simplified formalization of predicate logic with identity ⋮ The Interior Operator Logic and Product Topologies ⋮ Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic ⋮ Open formulas and the empty domain ⋮ A Fortuitous Year with Leon Henkin ⋮ A Bit of History Related to Logic Based on Equality ⋮ Leon Henkin the Reviewer ⋮ Henkin’s Theorem in Textbooks ⋮ Henkin on Completeness ⋮ The Countable Henkin Principle ⋮ April the 19th ⋮ Henkin and Hybrid Logic ⋮ Changing a Semantics: Opportunism or Courage? ⋮ The Semantic Function of the Axiomatic Method ⋮ Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) ⋮ Nonstandard arithmetic ⋮ Unnamed Item ⋮ The natural deduction systems for the three-valued nonsense logics Z and E ⋮ Lewisian Naturalness and a new Sceptical Challenge ⋮ Ein Henkin-Vollständigkeitsbeweis für die intuitionistische Prädikatelogik bezüglich der Kripke-Semantik ⋮ Natural deduction system for three-valued Heyting's logic ⋮ An extension of the Craig-Lyndon interpolation theorem ⋮ Identity, Equality, Nameability and Completeness ⋮ Theory of completeness for logical spaces ⋮ Distributed first order logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interval logics with applications to study of tense and aspect in English ⋮ Unnamed Item ⋮ INCOMPLETENESS VIA PARADOX AND COMPLETENESS ⋮ A decidable multi-modal logic of context ⋮ Neutral free logic: motivation, proof theory and models ⋮ A completeness theorem for the general interpreted modal calculus MC**nu of A. Bressan ⋮ Probabilistic logic over equations and domain restrictions ⋮ Mathematical modal logic: A view of its evolution ⋮ The Mathematical Development of Set Theory from Cantor to Cohen ⋮ Identity, equality, nameability and completeness. Part II ⋮ A collapse theorem for holographic algorithms with matchgates on domain size at most 4 ⋮ HENKIN CONSTRUCTIONS OF MODELS WITH SIZE CONTINUUM ⋮ Completeness in hybrid type theory ⋮ From Pictures to Semantical Games: Hintikka’s Journey Through Semantic Representationalism ⋮ The Discovery of My Completeness Proofs ⋮ Lindenbaum’s Lemma via Open Induction ⋮ The Number of Logical Values ⋮ Graded hypothesis theories ⋮ Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic ⋮ The seven virtues of simple type theory ⋮ Physical Computational Complexity and First-order Logic ⋮ Prior on the semantics of modal and tense logic ⋮ Kripke semantics for higher-order type theory applied to constraint logic programming languages ⋮ Revising Carnap's semantic conception of modality ⋮ Ontologically neutral logic ⋮ Alonzo church:his life, his work and some of his miracles ⋮ Models of complete theories ⋮ A categorical study on the finiteness of specifications ⋮ Proofs of the Compactness Theorem ⋮ Experimental logics and \(\Delta^0_2\)-theories ⋮ Investigations into quantified modal logic. I ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Erdős Graphs Resolve Fine's Canonicity Problem ⋮ Beyond Rasiowa's algebraic approach to non-classical logics ⋮ A modest logic of plurals ⋮ Completeness theorems for continuous functions and product topologies ⋮ A modal proof theory for final polynomial coalgebras ⋮ Completeness in equational hybrid propositional type theory ⋮ 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ Canonical extensions and ultraproducts of polarities ⋮ HasCasl: integrated higher-order specification and program development ⋮ Event-based time-stamped claim logic ⋮ A study of Kripke-type models for some modal logics by Gentzen's sequential method ⋮ Rasiowa–Sikorski Sets and Forcing ⋮ The Interpretation Existence Lemma ⋮ First order logic with empty structures ⋮ Limit Ultrapowers ⋮ Topologische Untersuchungen zur Semantik und Syntax Eines Erweiterten Prädikatenkalküls ⋮ In Memoriam: Leon Albert Henkin 1921–2006 ⋮ Completeness: from Gödel to Henkin ⋮ Leon Henkin ⋮ Completeness of the functional calculus of first order ⋮ The algebraic treatment of the methodology of elementary deductive systems ⋮ Remark on complete interpretations by models ⋮ Undecidable problems of elementary number theory ⋮ Completeness of calculii for axiomatically defined classes of algebras ⋮ Investigations in many-sorted quantor logic ⋮ Logic—The Big Picture ⋮ Model Theory for the Higher Order Predicate Calculus ⋮ Classifying categories for partial equational logic ⋮ Nicht-Standardmodelle der Zahlentheorie ⋮ Logical dual concepts based on mathematical morphology in stratified institutions: applications to spatial reasoning ⋮ Prior-type modal logic. II ⋮ Gödel's completeness theorem ⋮ An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models ⋮ Skolem redux ⋮ The compactness of first-order logic:from gödel to lindström ⋮ Axiomatisation and decidability of \(F\) and \(P\) in cyclical time
Cites Work
This page was built for publication: The completeness of the first-order functional calculus
