Sentences true in all constructive models

DOI10.2307/2964336MaRDI QIDQ3843616zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• Contributions to the reduction theory of the decision problem

Cited in

(16)

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

This page was built for publication: Sentences true in all constructive models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3843616)