Cover Image

Characterizing Sets of Theories That Can Be Disjointly Combined

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Przybocki, Benjamin, Toledo, Guilherme V., 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

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

Being polite is not enough (and other limits of theory combination)
by: Toledo, Guilherme V., et al.
Published: (2025)

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

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

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

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

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

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

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
by: Gratzer, Daniel, et al.
Published: (2024)

Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
by: Takahashi, Yuta
Published: (2024)

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

Disjoint Partial Enumeration without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2023)

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
by: Bogaerts, Bart, et al.
Published: (2022)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
by: Spallitta, Giuseppe, et al.
Published: (2024)

Rings and Boolean Algebras as Algebraic Theories
by: De Faveri, Arturo
Published: (2025)

Primitive Recursive Dependent Type Theory
by: Buchholtz, Ulrik, et al.
Published: (2024)

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

The Pebble-Relation Comonad in Finite Model Theory
by: Montacute, Yoàv, et al.
Published: (2021)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
by: Hermes, Marc, et al.
Published: (2023)

A Naive Encoding of Russell's Paradox in Type Theory
by: Qu, Zhuoyuan
Published: (2025)

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
by: Schirrmacher, Nicole, et al.
Published: (2023)

Proof Theory and Decision Procedures for Deontic STIT Logics
by: Lyon, Tim S., et al.
Published: (2024)

Non-Derivability Results in Polymorphic Dependent Type Theory
by: Geuvers, Herman
Published: (2026)

Universal Proof Theory, TACL 2022 Lecture Notes
by: Iemhoff, Rosalie, et al.
Published: (2023)

Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2018)

Universal Proof Theory: Semi-analytic Rules and Craig Interpolation
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2018)

Field Knowledge as a Dual to Distributed Knowledge: A Characterization by Weighted Modal Logic
by: Liang, Xiaolong, et al.
Published: (2024)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

A topological reading of inductive and coinductive definitions in Dependent Type Theory
by: Sabelli, Pietro
Published: (2024)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
by: De Domenico, Andrea, et al.
Published: (2024)

Gödel Incompleteness Theorem for PAC Learnable Theory from the view of complexity measurement
by: Ma, Zhifeng, et al.
Published: (2024)

Hammering Higher Order Set Theory
by: Brown, Chad E., et al.
Published: (2025)

Are Dependent Types in Set Theory Feasible?
by: Yang, Yunsong, et al.
Published: (2026)

The Groupoid-Syntax of Type Theory is a Set
by: Altenkirch, Thorsten, et al.
Published: (2025)

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

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

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

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