Pathologies in satisfaction classes

DOI10.1016/J.APAL.2023.103387MaRDI QIDQ6179830zbMATH OpenOpenAlexFDO

Authors Athar Abdul-Quader

Publication date 18 December 2023

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

arithmetical saturationdisjunctive correctnessnonstandard models of Peano arithmeticrecursive saturationsatisfaction classes

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Properties of classes of models (03C52) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Abstract: We study subsets of countable recursively saturated models of $mathsfPA$ which can be defined using pathologies in satisfaction classes. More precisely, we characterize those subsets $X$ such that there is a satisfaction class $S$ where $S$ behaves correctly on an idempotent disjunction of length $c$ if and only if $cinX$. We generalize this result to characterize several types of pathologies including double negations, blocks of extraneous quantifiers, and binary disjunctions and conjunctions. We find a surprising relationship between the cuts which can be defined in this way and arithmetic saturation: namely, a countable nonstandard model is arithmetically saturated if and only if every cut can be the "idempotent disjunctively correct cut" in some satisfaction class. We describe the relationship between types of pathologies and the closure properties of the cuts defined by these pathologies.

Cites work

• Construction of Satisfaction Classes for Nonstandard Models
• Full satisfaction classes, definability, and automorphisms
• Models of positive truth
• Models with the ω-property
• Nonstandard definability
• Notes on bounded induction for the compositional truth predicate
• The structure of models of Peano arithmetic
• The two halves of disjunctive correctness
• TRUTH AND FEASIBLE REDUCIBILITY
• Truth, disjunction, and induction

Cited in

(1)

• Satisfaction classes with approximate disjunctive correctness

This page was built for publication: Pathologies in satisfaction classes

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