The completeness of the first-order functional calculus
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Neutral free logic: motivation, proof theory and models
- An infinitary system for the least fixed-point logic restricted to finite models
- The logic of separation logic: models and proofs
- Completing the Riesz-Dunford functional calculus
- Prior-type modal logic. II
- Barwise: Infinitary Logic and Admissible Sets
- Changing a Semantics: Opportunism or Courage?
- From pictures to semantical games: Hintikka's journey through semantic representationalism
- Physical computational complexity and first-order logic
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Nicht-Standardmodelle der Zahlentheorie
- An extension of the Craig-Lyndon interpolation theorem
- Open formulas and the empty domain
- Completeness theorems for continuous functions and product topologies
- Graded hypothesis theories
- Abstract categorical logic
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Model Theory for the Higher Order Predicate Calculus
- Topologische Untersuchungen zur Semantik und Syntax Eines Erweiterten Prädikatenkalküls
- Prior on the semantics of modal and tense logic
- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- Models of complete theories
- Current trends in substructural logics
- Interval logics with applications to study of tense and aspect in English
- The number of logical values
- Remark on complete interpretations by models
- Completeness in equational hybrid propositional type theory
- Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
- Skolem redux
- Revising Carnap's semantic conception of modality
- Diagrammatic algebra of first order logic
- A modal proof theory for final polynomial coalgebras
- Logic—The Big Picture
- April the 19th
- Two interpolation theorems
- Ein Henkin-Vollständigkeitsbeweis für die intuitionistische Prädikatelogik bezüglich der Kripke-Semantik
- Investigations into quantified modal logic. I
- Natural deduction systems for some modifications of Kleene's and Dunn-Belnap's logics
- A study of Kripke-type models for some modal logics by Gentzen's sequential method
- Proofs of the compactness theorem
- A categorical study on the finiteness of specifications
- The seven virtues of simple type theory
- Henkin on completeness
- Tarskian Classical Relevant Logic
- A modest logic of plurals
- Axiomatisation and decidability of \(F\) and \(P\) in cyclical time
- The natural deduction systems for the three-valued nonsense logics Z and E
- Erdős Graphs Resolve Fine's Canonicity Problem
- Logical dual concepts based on mathematical morphology in stratified institutions: applications to spatial reasoning
- The Interior Operator Logic and Product Topologies
- Correspondence analysis for logic of rational agent
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \)
- Completeness of calculii for axiomatically defined classes of algebras
- Ontologically neutral logic
- Gödel's completeness theorem
- An axiomatic approach to the quantified argument calculus
- scientific article; zbMATH DE number 3069864 (Why is no real title available?)
- Henkin and hybrid logic
- Natural deduction system for three-valued Heyting's logic
- Ranks, spectra and their dynamics for families of constant expansions of theories
- On the Year of Publication of Tarski's ‘Der Wahrheitsbegriff in den formalisierten Sprachen’
- Lindenbaum's lemma via open induction
- Mathematical modal logic: A view of its evolution
- The interpretation existence lemma
- HENKIN CONSTRUCTIONS OF MODELS WITH SIZE CONTINUUM
- The compactness of first-order logic:from gödel to lindström
- Event-based time-stamped claim logic
- Probabilistic logic over equations and domain restrictions
- Identity, equality, nameability and completeness
- Nonstandard arithmetic
- Identity, equality, nameability and completeness. II
- The algebraic treatment of the methodology of elementary deductive systems
- A completeness theorem for the general interpreted modal calculus MC**nu of A. Bressan
- The Mathematical Development of Set Theory from Cantor to Cohen
- The Discovery of My Completeness Proofs
- Experimental logics and ^0_2-theories
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4
- Limit Ultrapowers
- Completeness of the functional calculus of first order
- Adding a constant and an axiom to a doctrine
- Logics for at most countable first-order structures
- A fortuitous year with Leon Henkin
- Categorical quantification
- Completeness in hybrid type theory
- A Boolean-algebraic approach to completeness for normal modal predicate logics
- Rasiowa-Sikorski sets and forcing
- scientific article; zbMATH DE number 764337 (Why is no real title available?)
- Undecidable problems of elementary number theory
- Investigations in many-sorted quantor logic
- Canonical extensions and ultraproducts of polarities
- Substitutionless predicate logic with identity
- A decidable multi-modal logic of context
- The countable Henkin principle
- HasCasl: integrated higher-order specification and program development
- Deep fried logic
- Alonzo church:his life, his work and some of his miracles
- Distributed first order logic
- Classifying categories for partial equational logic
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
This page was built for publication: The completeness of the first-order functional calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5791200)
