Sentences true in all constructive models

DOI10.2307/2964336zbMath0108.00801OpenAlexW1990016381MaRDI QIDQ3843616

R. Vaught

Publication date: 1960

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2964336

zbMATH Keywords

mathematical logic

Related Items

Succinct definitions in the first order theory of graphs, THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS, Changing a Semantics: Opportunism or Courage?, A representation independent language for planar spatial databases with Euclidean distance, Finitely representable databases, The theory of the \(\alpha \) degrees is undecidable, Linear constraint query languages expressive power and complexity, Trakhtenbrot theorem and first-order axiomatic extensions of MTL, MAXIMALITY OF LOGIC WITHOUT IDENTITY, On the possibility of inference to the best explanation, A uniform method for proving lower bounds on the computational complexity of logical theories, The logical study of science, Finite-model theory -- A personal perspective, Computable presentability of countable linear orders, Über rekursive Strukturen, The finite inseparability of the first-order theory of diagonalisable algebras

Cites Work

• Contributions to the reduction theory of the decision problem