:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Meadows, Toby
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	https://arxiv.org/abs/2511.02011
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Internal Categoricity and the Generic Multiverse
by: Meadows, Toby
Published: (2025)

Foundations with Imagination
by: Meadows, Toby
Published: (2026)

Teasing apart definitional equivalence
by: Chen, Jason, et al.
Published: (2025)

Well-Founded Coalgebras Meet König's Lemma
by: Urbat, Henning, et al.
Published: (2025)

Extended multi-adjoint logic programming
by: Cornejo, M. Eugenia, et al.
Published: (2024)

Weak Permission is not Well-Founded, Grounded and Stable
by: Governatori, Guido
Published: (2024)

Syntax and semantics of multi-adjoint normal logic programming
by: Cornejo, M. Eugenia, et al.
Published: (2024)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

Iterating Generalised Perfect Set Forcing Along Well-Founded Orders
by: Džamonja, Mirna
Published: (2026)

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

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
by: Powell, Thomas
Published: (2023)

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

Bit-Vector CHC Solving for Binary Analysis and Binary Analysis for Bit-Vector CHC Solving
by: Bembenek, Aaron, et al.
Published: (2026)

A Logic of Sattestation
by: Jaggard, Aaron D., et al.
Published: (2024)

Notes on the coexistence of limit notions
by: Yamazoe, Takashi
Published: (2024)

Additivity of derived limits in the Cohen model
by: Bannister, Nathaniel
Published: (2023)

On the computability of cofinal Fraïssé limits
by: Ackerman, Nathanael, et al.
Published: (2026)

Definable Obstruction Theory
by: Meadows, Nicholas
Published: (2025)

Projective Fraïssé limits and generalized Ważewski dendrites
by: Codenotti, Alessandro, et al.
Published: (2022)

Set-like operations on propositional logic programs
by: Antić, Christian
Published: (2026)

Generalized Von Neumann Universe and Non-Well-Founded Sets
by: Zhang, Eugene
Published: (2023)

A framework to measure the robustness of programs in the unpredictable environment
by: Castiglioni, Valentina, et al.
Published: (2021)

Foundations of logic programming in hybrid-dynamic quantum logic
by: Gaina, Daniel
Published: (2024)

On some Fraisse limits with free amalgamation
by: Bossut, Yvon
Published: (2024)

Kuroda's Translation for Higher-Order Logic
by: Traversié, Thomas
Published: (2024)

Modeling FO-limits for monadically stable sequences
by: Braunfeld, S., et al.
Published: (2025)

On Translating Epistemic Operators in a Logic of Awareness
by: Kubono, Yudai
Published: (2026)

Operational semantics and program verification using many-sorted hybrid modal logic
by: Leustean, Ioana, et al.
Published: (2019)

Translating Workflow Nets into the Partially Ordered Workflow Language
by: Kourani, Humam, et al.
Published: (2025)

Kuroda's Translation for the $λΠ$-Calculus Modulo Theory and Dedukti
by: Traversié, Thomas
Published: (2024)

Complete first-order reasoning for functional programs
by: Murali, Adithya, et al.
Published: (2026)

A feasible and unitary quantum programming language
by: Díaz-Caro, Alejandro, et al.
Published: (2023)

Checkpoint-based rollback recovery in session programming
by: Mezzina, Claudio Antares, et al.
Published: (2023)

Atomic Toposes with Co-Well-Founded Categories of Atoms
by: Marquès, Jérémie
Published: (2024)

Homeomorphisms of continua through projective Fraïssé limits
by: Poór, Márk, et al.
Published: (2025)

Logical limit laws for Mallows random permutations
by: Muller, Tobias, et al.
Published: (2023)

Projective Fraïssé limits of trees with confluent epimorphisms
by: Charatonik, Włodzimierz J., et al.
Published: (2023)

Inconsistent Ontology Handling by Translating Description Logics into Defeasible Logic Programming
by: Sergio Alejandro Gómez
Published: (2007)

A programming language characterizing quantum polynomial time
by: Hainry, Emmanuel, et al.
Published: (2022)

Learning logic programs by finding minimal unsatisfiable subprograms
by: Cropper, Andrew, et al.
Published: (2024)