Cover Image

Being polite is not enough (and other limits of theory combination)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Toledo, Guilherme V., Przybocki, Benjamin, Zohar, Yoni
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)

Shininess, strong politeness, and unicorns
by: Przybocki, Benjamin, et al.
Published: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)

Number theory combination: natural density and SMT
by: Toledo, Guilherme V., et al.
Published: (2025)

Combining Combination Properties: Minimal Models
by: de Toledo, Guilherme Vicentin, et al.
Published: (2024)

Near-Optimal Encodings of Cardinality Constraints
by: Krapivin, Andrew, et al.
Published: (2026)

The termination of Nielsen transformations applied to word equations with length constraints
by: Przybocki, Benjamin, et al.
Published: (2025)

Automated Reencoding Meets Graph Theory
by: Przybocki, Benjamin, et al.
Published: (2026)

First-order Logic with Being a Thesis Modal Operator
by: Łyczak, Marcin
Published: (2024)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
by: Lyon, Tim S., et al.
Published: (2023)

Undecidability of theories of semirings with fixed points
by: Das, Anupam, et al.
Published: (2025)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

The proof theory and semantics of second-order (intuitionistic) tense logic
by: Becker, Justus, et al.
Published: (2026)

Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Domain theory in univalent foundations I: Directed complete posets and Scott's $D_\infty$
by: de Jong, Tom
Published: (2024)

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024)

Collapsing the bounded width hierarchy for infinite-domain CSPs: when symmetries are enough
by: Mottet, Antoine, et al.
Published: (2021)

Proof-theoretic Semantics for First-order Logic
by: Gheorghiu, Alexander V.
Published: (2024)

Support is Search
by: Gheorghiu, Alexander V.
Published: (2026)

Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
by: Gheorghiu, Alexander V., et al.
Published: (2025)

The Leibniz adjunction in homotopy type theory, with an application to simplicial type theory
by: de Jong, Tom, et al.
Published: (2026)

Proof-theoretic Semantics for Second-order Logic
by: Gheorghiu, Alexander V., et al.
Published: (2025)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

Semantic Foundations of Reductive Reasoning
by: Gheorghiu, Alexander V., et al.
Published: (2024)

Proof-theoretic Semantics for the Logic of Bunched Implications
by: Gu, Tao, et al.
Published: (2023)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
by: Gheorghiu, Alexander V., et al.
Published: (2023)

Homotopy type theory as a language for diagrams of $\infty$-logoses
by: Uemura, Taichi
Published: (2022)

Formalizing two-level type theory with cofibrant exo-nat
by: Uskuplu, Elif
Published: (2023)

Yet another cubical type theory, but via a semantic approach
by: Kapulkin, Chris, et al.
Published: (2025)

Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
by: Spadetto, Matteo
Published: (2023)

There are (other) ways to negate in propositional team semantics
by: Yang, Fan
Published: (2024)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
by: Livson, Ori, et al.
Published: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
by: Oda, Yukihiro
Published: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
by: Hansen, Helle Hvid, et al.
Published: (2025)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)