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.
Publisher
Cambridge University Press (CUP)
Reference20 articles.
1. Cobham A. , Some results concerning theories with recursively enumerable complements, to appear in this Journal.
2. On a system of axioms which has no recursively enumerable arithmetic model
3. Decidability and essential undecidability;Putnam;this Journal,1957
4. The completeness of the first-order functional calculus;Henkin;this Journal,1949
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. MAXIMALITY OF LOGIC WITHOUT IDENTITY;The Journal of Symbolic Logic;2023-01-10
2. Computable Presentability of Countable Linear Orders;Journal of Mathematical Sciences;2021-06-10
3. Computational properties of the logic of partial quasiary predicates;Conference of the South African Institute of Computer Scientists and Information Technologists 2020;2020-09-11
4. Undecidable problems for modal definability: Table 1.;Journal of Logic and Computation;2016-02-14
5. Trakhtenbrot Theorem and First-Order Axiomatic Extensions of MTL;Studia Logica;2015-05-16