Image de couverture de livre

Computation by infinite descent made explicit

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Enqvist, Sebastian
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

From Herbrand schemes to functional interpretation
par: Enqvist-Pyk, Sebastian
Publié: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
par: Mottet, Antoine, et autres
Publié: (2023)

Bridging Computational Notions of Depth
par: Bienvenu, Laurent, et autres
Publié: (2024)

Dynamic Probability Logic: Decidability & Computability
par: Chopoghloo, Somayeh, et autres
Publié: (2024)

Fixed Point Theorems in Computability Theory
par: Terwijn, Sebastiaan A.
Publié: (2024)

Computing with Infinite Objects: the Gray Code Case
par: Spreen, Dieter, et autres
Publié: (2021)

Algebraic and algorithmic synergies between promise and infinite-domain CSPs
par: Mottet, Antoine
Publié: (2025)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
par: Benedikt, Michael, et autres
Publié: (2026)

Collapsing the bounded width hierarchy for infinite-domain CSPs: when symmetries are enough
par: Mottet, Antoine, et autres
Publié: (2021)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

Countability constraints in order-theoretic approaches to computability
par: Hack, Pedro, et autres
Publié: (2022)

Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
par: Češka, Milan, et autres
Publié: (2026)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
par: Brunar, Johanna, et autres
Publié: (2025)

Computation and Concurrency
par: Wang, Yong
Publié: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
par: Fuchser, Janne, et autres
Publié: (2025)

Compositional Reversible Computation
par: Carette, Jacques, et autres
Publié: (2024)

Algorithmic Problems for Computation Trees
par: Moshkov, Mikhail
Publié: (2025)

Computational Complexity of Standpoint LTL
par: Demri, Stéphane, et autres
Publié: (2024)

Symbolic Computation for All the Fun
par: Brown, Chad E., et autres
Publié: (2024)

An Axiomatic Theory for Reversible Computation
par: Lanese, Ivan, et autres
Publié: (2023)

The paradoxes and the infinite dazzled ancient mathematics and continue to do so today
par: Kamareddine, Fairouz, et autres
Publié: (2024)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Efficient Volume Computation for SMT Formulas
par: Shaw, Arijit, et autres
Publié: (2025)

A Diagrammatic Basis for Computer Programming
par: Bonchi, Filippo, et autres
Publié: (2025)

Choiceless Computation and Symmetry: Limitations of Definability
par: Pago, Benedikt
Publié: (2024)

Computable domains of a Halting Function
par: Peralta, Abel Luis
Publié: (2024)

Computing Witnesses Using the SCAN Algorithm
par: Achammer, Fabian, et autres
Publié: (2026)

Computing Fixpoints of Learned Functions: Chaotic Iteration and Simple Stochastic Games
par: Baldan, Paolo, et autres
Publié: (2026)

Sequent Calculi for Data-Aware Modal Logics
par: Areces, Carlos, et autres
Publié: (2025)

On the Computability of Measures of Regular Sets of Infinite Trees
par: Niwiński, Damian, et autres
Publié: (2023)

On the Computational Content of Moduli of Regularity and their Logical Strength
par: Kohlenbach, Ulrich
Publié: (2026)

Computational expressivity of (circular) proofs with fixed points
par: Curzi, Gianluca, et autres
Publié: (2023)

Evidence-Tracked Tape Semantics for Probabilistic Computation
par: Cohen, Liron, et autres
Publié: (2026)

SAT-based Learning of Computation Tree Logic
par: Pommellet, Adrien, et autres
Publié: (2024)

Computational Paths Form a Weak ω-Groupoid
par: Ramos, Arthur F., et autres
Publié: (2025)

Computing Supported Models via Transformation to Stable Models
par: Li, Fang, et autres
Publié: (2025)

Computation of Interpolants for Description Logic Concepts in Hard Cases
par: Jung, Jean Christoph, et autres
Publié: (2025)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
par: Li, Yongming
Publié: (2025)

Computing Witnesses Using the SCAN Algorithm (Extended Preprint)
par: Achammer, Fabian, et autres
Publié: (2025)