arxiv: 2605.02725 · v1 · submitted 2026-05-04 · 🧮 math.LO

Recognition: unknown

More on expressibility of satisfiability in submodels and extensions

Denis I. Saveliev, Nikolai L. Poliakov

Pith reviewed 2026-05-08 02:22 UTC · model grok-4.3

classification 🧮 math.LO

keywords expressibilityinfinitary languagessubmodelsextensionsmodel theorymodal operatorsuniversal theoriessatisfiability

0 comments

The pith

In finitary or strongly compact languages, satisfiability in extensions is always expressible by a universal theory even when no single sentence suffices.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper investigates when infinitary languages can express the property that a sentence holds in some submodel or some extension of a given model. It supplies a syntactic test for this expressibility in finitary predicate languages and establishes that many infinitary languages, including all those with purely monadic signatures, are closed under the submodel operator. The main result is that the extension operator, though sometimes inexpressible by one sentence, is always captured by a universal theory whenever the language is finitary or strongly compact. This universal-theory expressibility fails to hold in the same way for the submodel operator, marking a clear asymmetry between the two model-theoretic directions.

Core claim

In any finitary or strongly compact language, the operator that maps a sentence to the statement that it is satisfied in some extension of the model is expressible by a universal theory, even in cases where no single sentence of the language can do the job. By contrast, the corresponding operator for submodels lacks this form of expressibility in general.

What carries the argument

The modal operators for submodel-satisfiability and extension-satisfiability, together with the distinction between single-sentence expressibility and expressibility by a universal theory.

If this is right

Infinitary languages are closed under the submodel operator in many cases.
Every language whose signature is purely monadic is closed under the submodel operator.
A purely syntactic criterion decides single-sentence expressibility for finitary predicate languages.
The extension operator admits universal-theory expressibility in every finitary language and every strongly compact language.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The asymmetry suggests that extension properties may be easier to axiomatize than submodel properties across a wider range of logics.
The result raises the question of whether similar universal-theory expressibility holds for other model-theoretic operations such as unions or direct products.
Counterexamples to universal expressibility are likely to appear only in languages that violate both finiteness and strong compactness.

Load-bearing premise

The language must be either finitary or strongly compact.

What would settle it

An explicit infinitary language that is neither finitary nor strongly compact, together with a sentence whose extension-satisfiability cannot be captured by any universal theory in that language.

read the original abstract

We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary predicate languages, show that in many cases infinitary languages are closed under the operator associated with submodels, and that this is so in any language with a purely monadic signature. Finally, we prove that in finitary or strongly compact languages, the operator associated with extensions, though can be inexpressible by a single sentence, is always expressible by a universal theory, in striking contrast with the submodel case.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper adds a syntactic criterion for finitary expressibility and closure properties for infinitary languages under submodel operators, with a contrast for extensions.

read the letter

The main thing to take from this paper is that it supplies a syntactic criterion for expressibility of the submodel operator in finitary languages and establishes closure under that operator for various infinitary languages, with a special case for monadic signatures. It also shows that the extension operator, while not always expressible by one sentence, can be captured by a universal theory in finitary or strongly compact languages. This sets up a clear contrast between the two cases. What is actually new here is the syntactic criterion and the closure properties for infinitary languages, which the abstract indicates were not in the prior literature. The work does well in organizing these expressibility questions and using standard compactness arguments to prove the results. The statements are precise, and the distinction between submodels and extensions holds up internally. The soft spots are limited. The results hinge on the language being finitary or strongly compact for the extension part, and the paper flags this condition rather than assuming it universally. Since only the abstract is available for review, the full proofs remain unchecked, but nothing in the stated claims suggests inconsistency or unsupported steps. The arguments appear to derive directly from definitions of the languages and models. This paper is for model theorists and logicians who work on infinitary logics and definability issues. Someone already engaged with modal operators in these settings or questions of compactness would find the specific criteria and the new contrast useful. It is not broad enough to interest a general audience but is a solid piece of technical work. I would recommend that a serious editor send this to peer review. The claims are grounded enough and the novelty is real within the subfield to justify referee time, even if revisions might be needed for the details of the proofs.

Referee Report

0 major / 2 minor

Summary. The paper studies the expressibility of modal operators for satisfiability in submodels and extensions of models, within infinitary languages. It supplies a syntactic criterion for expressibility in finitary predicate languages, establishes that infinitary languages are closed under the submodel operator in many cases (including all purely monadic signatures), and proves that in finitary or strongly compact languages the extension operator, while not always expressible by a single sentence, is always expressible by a universal theory, in contrast to the submodel case.

Significance. If the central claims hold, the work sharpens the distinction between submodel and extension operators in model theory for infinitary logics. The syntactic criterion and compactness arguments are grounded in standard definitions and provide a precise, falsifiable contrast that could inform further research on modal operators in logic. The explicit restriction to finitary or strongly compact languages is presented as part of the result rather than a hidden assumption.

minor comments (2)

[Abstract] Abstract: the clause 'though can be inexpressible by a single sentence' is grammatically awkward and should be rephrased for clarity (e.g., 'although it cannot always be expressed by a single sentence').
[Introduction] The manuscript would benefit from an explicit statement, early in the introduction, of the precise definition of 'strongly compact language' used throughout the proofs, to avoid any ambiguity for readers unfamiliar with the specific infinitary setting.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment and recommendation of minor revision. The summary correctly identifies the paper's focus on syntactic criteria for expressibility, closure under submodel operators (including monadic cases), and the contrast with extension operators expressible via universal theories in finitary or strongly compact languages.

Circularity Check

0 steps flagged

No significant circularity: derivation from standard definitions

full rationale

The paper derives expressibility results for modal operators associated with submodels and extensions directly from the syntactic and semantic definitions of finitary and infinitary languages, models, and compactness (including strong compactness). All steps are explicit proofs using standard model-theoretic notions; no quantities are fitted, no self-definitional loops exist, and no load-bearing self-citations reduce claims to unverified inputs. The language restrictions are stated as explicit hypotheses rather than smuggled assumptions. The work is self-contained against external logical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper works entirely within standard model theory and infinitary logic; it introduces no new free parameters, no ad-hoc axioms beyond ordinary set-theoretic background, and no invented entities.

axioms (1)

standard math Standard axioms of first-order and infinitary model theory (including definitions of submodels, extensions, and language signatures)
Invoked throughout to define the operators and languages under study

pith-pipeline@v0.9.0 · 5399 in / 1318 out tokens · 59728 ms · 2026-05-08T02:22:58.124182+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

17 extracted references

[1]

Barwise, S

J. Barwise, S. Feferman (editors),Model-theoretic logics, Perspectives in Mathematical Logic 8, Springer-Verlag, New York, 1985

1985
[2]

B¨ orger, E

E. B¨ orger, E. Gr¨ ader, Y. Gurevich,The classical decision problems, Springer, Berlin–Heidelberg, 1997

1997
[3]

Chang, H.J

C.C. Chang, H.J. Keisler,Model theory, third edition, North-Holland, Amsterdam–London–New York, 1990

1990
[4]

Cohn,Universal algebra, ser

P.M. Cohn,Universal algebra, ser. Mathematics and its applications 6, Springer, Berlin–Heidelberg, 1981

1981
[5]

Dickmann,Large infinitary languages: model theory, Studies in Logic and the Foundations of Mathematics, 83, North-Holland, Amsterdam–Oxford–New York, 1975

M.A. Dickmann,Large infinitary languages: model theory, Studies in Logic and the Foundations of Mathematics, 83, North-Holland, Amsterdam–Oxford–New York, 1975

1975
[6]

Drake,Set theory: an introduction to large cardinals, Studies in Logic and the Foundations of Mathematics, 76, North-Holland, Amsterdam–Oxford–New York, 1974

F.R. Drake,Set theory: an introduction to large cardinals, Studies in Logic and the Foundations of Mathematics, 76, North-Holland, Amsterdam–Oxford–New York, 1974

1974
[7]

Jech,Set theory, third edition, revised and expanded, Springer-Verlag, Berlin–Heidelberg, 2003

T. Jech,Set theory, third edition, revised and expanded, Springer-Verlag, Berlin–Heidelberg, 2003

2003
[8]

Kanamori,The higher infinite: large cardinals in set theory from their beginnings, second edition, Springer-Verlag, Berlin–Heidelberg, 2003

A. Kanamori,The higher infinite: large cardinals in set theory from their beginnings, second edition, Springer-Verlag, Berlin–Heidelberg, 2003

2003
[9]

Compact spaces, compact cardinals, and elementary submodels

K. Kunen, “Compact spaces, compact cardinals, and elementary submodels”,Topology and its Ap- plications, 130 (2003), 99–109

2003
[10]

Embedding semigroups in groups: not as simple as it might seem

C. Hollings, “Embedding semigroups in groups: not as simple as it might seem”,Archive for History of Exact Sciences, 68:5 (2014), 641–692

2014
[11]

¨Uber M¨ oglichkeiten im Relativkalk¨ ul

L. L¨ owenheim, “¨Uber M¨ oglichkeiten im Relativkalk¨ ul”,Mathematische Annalen, 76 (1915), 447–470

1915
[12]

On the Role of Supercompact and Extendible Cardinals in Logic

M. Magidor, “On the Role of Supercompact and Extendible Cardinals in Logic”,Israel Journal of Mathematics, 10:2 (1971), 147–157

1971
[13]

Ontheimmersionofassociativesystemsingroups

A.I.Maltsev, “Ontheimmersionofassociativesystemsingroups”,Matematicheskii sbornik, 6(1939), 331–336 (in Russian)

1939
[14]

On the immersion of associative systems in groups II

A.I. Maltsev, “On the immersion of associative systems in groups II”,Matematicheskii sbornik, 8 (1940), 251–264 (in Russian)

1940
[15]

On modal logics of model-theoretic relations

D.I. Saveliev, I.B. Shapirovsky, “On modal logics of model-theoretic relations”, Studia Logica 108 (2020), 989–1017. 11

2020
[16]

Medvedev’s logic and products of converse well orders

D.I. Saveliev, I.B. Shapirovsky, “Medvedev’s logic and products of converse well orders”, Advances in Modal Logic, 14, College Publications, 2022, 681–696

2022
[17]

On first-order expressibility of satisfiability in submodels

D.I. Saveliev, “On first-order expressibility of satisfiability in submodels”, in: R. Iemhoff, M. Moort- gat, R. de Queiroz (eds), Logic, Language, Information, and Computation, WoLLIC 2019, Lecture Notes in Computer Science, 11541 (2019), Springer, Berlin–Heidelberg, 584–593. HSE University E-mail address:niknikols0@gmail.com Higher School of Modern Math...

2019