A formula with no recursively enumerable model

Publisher Website

1 January 1979

book chapter
Published by Elsevier

p. 259-274
https://doi.org/10.1016/s0049-237x(09)70260-5

Abstract

No abstract available

Keywords

This publication has 5 references indexed in Scilit:

On a system of axioms which has no recursively enumerable arithmetic model
Fundamenta Mathematicae, 1953
Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus II
Published by Philosophy Documentation Center ,1953
On definable sets of positive integers
Fundamenta Mathematicae, 1947
Formal Reductions of the General Combinatorial Decision Problem
American Journal of Mathematics, 1943
A system of axiomatic set theory—Part I
The Journal of Symbolic Logic, 1937