JOURNAL ARTICLE
Weak definability in infinitary languages
Year: 1973 Journal: Journal of Symbolic Logic Vol: 38 (3)Pages: 399-404 Publisher: Cambridge University Press
Abstract
Abstract We shall prove that if a model of cardinality κ can be expanded to a model of a sentence ψ of by adding a suitable predicate in more than κ ways, then , it has a submodel of power μ which can be expanded to a model of ψ in > μ ways provided that λ , κ , μ satisfy suitable conditions.
Keywords:
Predicate (mathematical logic) Cardinality (data modeling) Expressive power Sentence Computer science Mathematics Discrete mathematics Theoretical computer science Artificial intelligence Programming language Data mining
Metrics
2
Cited By
0.53
FWCI (Field Weighted Citation Impact)
22
Refs
0.61
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Advanced Algebra and Logic
Physical Sciences → Computer Science → Computational Theory and Mathematics
Advanced Topology and Set Theory
Physical Sciences → Mathematics → Geometry and Topology
Logic, Reasoning, and Knowledge
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
BOOK-CHAPTER
Definability, automorphisms, and infinitary languages
Lecture notes in mathematics Year: 1968 Pages: 152-165
JOURNAL ARTICLE
Implicit definability and infinitary languages
Journal: Journal of Symbolic Logic Year: 1968 Vol: 33 (3)Pages: 446-451
JOURNAL ARTICLE
Beth definability in infinitary languages
Journal: Journal of Symbolic Logic Year: 1974 Vol: 39 (1)Pages: 22-26
JOURNAL ARTICLE
Uniform inductive definability and infinitary languages
Journal: Journal of Symbolic Logic Year: 1976 Vol: 41 (1)Pages: 109-120
JOURNAL ARTICLE
Uniform inductive definability and infinitary languages
Journal: Journal of Symbolic Logic Year: 1976 Vol: 41 (1)Pages: 109-120