Imagen de Portada

Computation by infinite descent made explicit

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Enqvist, Sebastian
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

From Herbrand schemes to functional interpretation
por: Enqvist-Pyk, Sebastian
Publicado: (2026)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

Bridging Computational Notions of Depth
por: Bienvenu, Laurent, et al.
Publicado: (2024)

Dynamic Probability Logic: Decidability & Computability
por: Chopoghloo, Somayeh, et al.
Publicado: (2024)

Fixed Point Theorems in Computability Theory
por: Terwijn, Sebastiaan A.
Publicado: (2024)

Computing with Infinite Objects: the Gray Code Case
por: Spreen, Dieter, et al.
Publicado: (2021)

Algebraic and algorithmic synergies between promise and infinite-domain CSPs
por: Mottet, Antoine
Publicado: (2025)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
por: Benedikt, Michael, et al.
Publicado: (2026)

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

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

Countability constraints in order-theoretic approaches to computability
por: Hack, Pedro, et al.
Publicado: (2022)

Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
por: Češka, Milan, et al.
Publicado: (2026)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
por: Brunar, Johanna, et al.
Publicado: (2025)

Computation and Concurrency
por: Wang, Yong
Publicado: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
por: Fuchser, Janne, et al.
Publicado: (2025)

Compositional Reversible Computation
por: Carette, Jacques, et al.
Publicado: (2024)

Algorithmic Problems for Computation Trees
por: Moshkov, Mikhail
Publicado: (2025)

Computational Complexity of Standpoint LTL
por: Demri, Stéphane, et al.
Publicado: (2024)

Symbolic Computation for All the Fun
por: Brown, Chad E., et al.
Publicado: (2024)

An Axiomatic Theory for Reversible Computation
por: Lanese, Ivan, et al.
Publicado: (2023)

The paradoxes and the infinite dazzled ancient mathematics and continue to do so today
por: Kamareddine, Fairouz, et al.
Publicado: (2024)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

Existential Positive Transductions of Sparse Graphs
por: Mählmann, Nikolas, et al.
Publicado: (2026)

Efficient Volume Computation for SMT Formulas
por: Shaw, Arijit, et al.
Publicado: (2025)

A Diagrammatic Basis for Computer Programming
por: Bonchi, Filippo, et al.
Publicado: (2025)

Choiceless Computation and Symmetry: Limitations of Definability
por: Pago, Benedikt
Publicado: (2024)

Computable domains of a Halting Function
por: Peralta, Abel Luis
Publicado: (2024)

Computing Witnesses Using the SCAN Algorithm
por: Achammer, Fabian, et al.
Publicado: (2026)

Computing Fixpoints of Learned Functions: Chaotic Iteration and Simple Stochastic Games
por: Baldan, Paolo, et al.
Publicado: (2026)

Sequent Calculi for Data-Aware Modal Logics
por: Areces, Carlos, et al.
Publicado: (2025)

On the Computability of Measures of Regular Sets of Infinite Trees
por: Niwiński, Damian, et al.
Publicado: (2023)

On the Computational Content of Moduli of Regularity and their Logical Strength
por: Kohlenbach, Ulrich
Publicado: (2026)

Computational expressivity of (circular) proofs with fixed points
por: Curzi, Gianluca, et al.
Publicado: (2023)

Evidence-Tracked Tape Semantics for Probabilistic Computation
por: Cohen, Liron, et al.
Publicado: (2026)

SAT-based Learning of Computation Tree Logic
por: Pommellet, Adrien, et al.
Publicado: (2024)

Computational Paths Form a Weak ω-Groupoid
por: Ramos, Arthur F., et al.
Publicado: (2025)

Computing Supported Models via Transformation to Stable Models
por: Li, Fang, et al.
Publicado: (2025)

Computation of Interpolants for Description Logic Concepts in Hard Cases
por: Jung, Jean Christoph, et al.
Publicado: (2025)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
por: Li, Yongming
Publicado: (2025)

Computing Witnesses Using the SCAN Algorithm (Extended Preprint)
por: Achammer, Fabian, et al.
Publicado: (2025)