:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Meadows, Toby
Format:	Preprint
Publié:	2025
Sujets:	Logic
Accès en ligne:	https://arxiv.org/abs/2511.02011
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Internal Categoricity and the Generic Multiverse
par: Meadows, Toby
Publié: (2025)

Foundations with Imagination
par: Meadows, Toby
Publié: (2026)

Teasing apart definitional equivalence
par: Chen, Jason, et autres
Publié: (2025)

Well-Founded Coalgebras Meet König's Lemma
par: Urbat, Henning, et autres
Publié: (2025)

Extended multi-adjoint logic programming
par: Cornejo, M. Eugenia, et autres
Publié: (2024)

Weak Permission is not Well-Founded, Grounded and Stable
par: Governatori, Guido
Publié: (2024)

Syntax and semantics of multi-adjoint normal logic programming
par: Cornejo, M. Eugenia, et autres
Publié: (2024)

Proof complexity of positive branching programs
par: Das, Anupam, et autres
Publié: (2021)

Iterating Generalised Perfect Set Forcing Along Well-Founded Orders
par: Džamonja, Mirna
Publié: (2026)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
par: Lyon, Tim S., et autres
Publié: (2023)

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

Being polite is not enough (and other limits of theory combination)
par: Toledo, Guilherme V., et autres
Publié: (2025)

Bit-Vector CHC Solving for Binary Analysis and Binary Analysis for Bit-Vector CHC Solving
par: Bembenek, Aaron, et autres
Publié: (2026)

A Logic of Sattestation
par: Jaggard, Aaron D., et autres
Publié: (2024)

Notes on the coexistence of limit notions
par: Yamazoe, Takashi
Publié: (2024)

Additivity of derived limits in the Cohen model
par: Bannister, Nathaniel
Publié: (2023)

On the computability of cofinal Fraïssé limits
par: Ackerman, Nathanael, et autres
Publié: (2026)

Definable Obstruction Theory
par: Meadows, Nicholas
Publié: (2025)

Projective Fraïssé limits and generalized Ważewski dendrites
par: Codenotti, Alessandro, et autres
Publié: (2022)

Set-like operations on propositional logic programs
par: Antić, Christian
Publié: (2026)

Generalized Von Neumann Universe and Non-Well-Founded Sets
par: Zhang, Eugene
Publié: (2023)

A framework to measure the robustness of programs in the unpredictable environment
par: Castiglioni, Valentina, et autres
Publié: (2021)

Foundations of logic programming in hybrid-dynamic quantum logic
par: Gaina, Daniel
Publié: (2024)

On some Fraisse limits with free amalgamation
par: Bossut, Yvon
Publié: (2024)

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

Modeling FO-limits for monadically stable sequences
par: Braunfeld, S., et autres
Publié: (2025)

On Translating Epistemic Operators in a Logic of Awareness
par: Kubono, Yudai
Publié: (2026)

Operational semantics and program verification using many-sorted hybrid modal logic
par: Leustean, Ioana, et autres
Publié: (2019)

Translating Workflow Nets into the Partially Ordered Workflow Language
par: Kourani, Humam, et autres
Publié: (2025)

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

Complete first-order reasoning for functional programs
par: Murali, Adithya, et autres
Publié: (2026)

A feasible and unitary quantum programming language
par: Díaz-Caro, Alejandro, et autres
Publié: (2023)

Checkpoint-based rollback recovery in session programming
par: Mezzina, Claudio Antares, et autres
Publié: (2023)

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

Homeomorphisms of continua through projective Fraïssé limits
par: Poór, Márk, et autres
Publié: (2025)

Logical limit laws for Mallows random permutations
par: Muller, Tobias, et autres
Publié: (2023)

Projective Fraïssé limits of trees with confluent epimorphisms
par: Charatonik, Włodzimierz J., et autres
Publié: (2023)

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

A programming language characterizing quantum polynomial time
par: Hainry, Emmanuel, et autres
Publié: (2022)

Learning logic programs by finding minimal unsatisfiable subprograms
par: Cropper, Andrew, et autres
Publié: (2024)