Sentences true in all constructive models
- 12 March 1960
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 25 (1) , 39-53
- https://doi.org/10.2307/2964336
Abstract
Let P0, …,Pq be predicates, of which at least one has two or more places. By a formula in P0, …, Pq (or simply a formula, when the list P0, …, Pq is fixed, as in this section) is meant any formula whose only symbols, other than sentential connectives, quantifiers, and (individual) variables, are among P0, …, Pq. A realization (or possible model) of such a formula is a system where A is a non-empty set and each Pk is a relation among the elements of A, having the same number of places as Pk.Keywords
This publication has 9 references indexed in Scilit:
- The definition of finite set and the deductive incompleteness of the theory of setsAmerican Mathematical Society Translations: Series 2, 1964
- Sentences true in all constructive modelsThe Journal of Symbolic Logic, 1960
- Decidability and essential undecidabilityThe Journal of Symbolic Logic, 1957
- Two theories with axioms built by means of pleonasmsThe Journal of Symbolic Logic, 1957
- A formula with no recursively enumerable modelFundamenta Mathematicae, 1955
- Undecidable Theories. By A. Tarski, A. Mostowski. and R. M. Robinson. Pp. 98. 18s. 1953. Studies in Logic and the Foundations of Mathematics. (North Holland Co., Amsterdam)The Mathematical Gazette, 1954
- On a system of axioms which has no recursively enumerable arithmetic modelFundamenta Mathematicae, 1953
- Contributions to the reduction theory of the decision problemActa Mathematica Hungarica, 1951
- The completeness of the first-order functional calculusThe Journal of Symbolic Logic, 1949