Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T02:11:46.301Z Has data issue: false hasContentIssue false

Remarks on an infinitary language with constructive formulas

Published online by Cambridge University Press:  12 March 2014

E. G. K. Lopez-Escobar*
Affiliation:
Massachusetts Institute of Technology

Extract

It is well known that L, the first-order predicate calculus, is unsuitable for characterizing certain mathematical structures. Since some of those structures are quite often considered by mathematicians, extensions of L have been considered which (partially) solve the above problem. Roughly speaking, the extensions of L fall into two main categories:

(I) extensions obtained by allowing higher order variables, and

(II) extensions obtained by allowing infinitely long formulas.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1967

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