Full satisfaction classes, definability, and automorphisms

DOI10.1215/00294527-2022-0013OpenAlexW3153015529MaRDI QIDQ2153826

Bartosz Wcisło

Publication date: 13 July 2022

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.09969

zbMATH Keywords

automorphismsdefinable subsetsdefinable elementssatisfaction classesfull satisfaction classesquantifier correctness

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35) Philosophical aspects of logic and foundations (03A99)

Related Items (1)

Pathologies in satisfaction classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonstandard definability
• Deflationary truth and pathologies
• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• A note on satisfaction classes
• Truth, disjunction, and induction
• Construction of Satisfaction Classes for Nonstandard Models
• Full Satisfaction Classes and Recursive Saturation
• A Rather Classless Model
• Toward model theory through recursive saturation
• DISJUNCTIONS WITH STOPPING CONDITIONS
• Kernels, truth and satisfaction
• On Languages Which are Based on Non-Standard Arithmetic

This page was built for publication: Full satisfaction classes, definability, and automorphisms