On sets of relations definable by addition

DOI10.2307/2273595zbMath0504.03013OpenAlexW2143340377MaRDI QIDQ4739895

James F. Lynch

Publication date: 1982

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

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

zbMATH Keywords

finite modelsdefinabilitycountable modelsEhrenfeucht game

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15)

Related Items (5)

Probabilities of First-Order Sentences about Unary Functions ⋮ An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ First-order expressibility of languages with neutral letters or: The Crane Beach conjecture ⋮ \(\Sigma_ 1^ 1\)-formulae on finite structures ⋮ Complexity classes and theories of finite models

Cites Work

• Unnamed Item
• Concerning measures in first order calculi
• Weak Second‐Order Arithmetic and Finite Automata
• Almost sure theories
• Monadic generalized spectra
• Local definability theory
• On boolean functions and connected sets

This page was built for publication: On sets of relations definable by addition