Amanote Research

Amanote Research

    RegisterSign In

The Completeness of the First-Order Functional Calculus

Journal of Symbolic Logic - United Kingdom
doi 10.2307/2267044
Full Text
Open PDF
Abstract

Available in full text

Categories
PhilosophyLogic
Date

September 1, 1949

Authors
Leon Henkin
Publisher

Cambridge University Press (CUP)


Related search

On Arithmetical Completeness of First-Order Logics of Provability

2002English

A Resolution Calculus for First-Order Schemata

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices
Computer Science
2015English

Completeness and Decidability Results for First-Order Clauses With Indices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

On Completeness of Root Vectors of the Cauchy Problem of the First Order Equation With Deviating Argument

PHYSICO-MATHEMATICAL SERIES
2020English

A Monotonicity Calculus and Its Completeness

2017English

Extracting the Resolution Algorithm From a Completeness Proof for the Propositional Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Strong Completeness of the Lambek Calculus With Respect to Relational Semantics

Banach Center Publications
1993English

Completeness for First-Order Properties on Sparse Structures With Algorithmic Applications

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy