Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T16:29:58.100Z Has data issue: false hasContentIssue false

Independence proofs in predicate logic with infinitely long expressions

Published online by Cambridge University Press:  12 March 2014

Carol R. Karp*
Affiliation:
University of Maryland

Extract

The systems of predicate logic considered here are extensions of ordinary first-order predicate logic. They were obtained by first admitting infinite conjunctions, disjunctions, and quantifications into formulas, and then adjusting the axiom schemata and rules of inference to accommodate them. In this paper, only systems with formulas of denumerable length and “formal proofs” with denumerably many steps will be discussed, though such restrictions are hardly essential. The systems with denumerable conjunctions and disjunctions, but finite quantifications, are semantically complete; i.e., valid formulas are provable. However, systems in which denumerably infinite quantifications are also allowed, are semantically incomplete.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1962

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable