Image de couverture de livre

Computing with Infinite Objects: the Gray Code Case

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Spreen, Dieter, Berger, Ulrich
Format:	Preprint
Publié:	2021
Sujets:	Logic in Computer Science Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Infinite trees
par: Goy, Alexandre
Publié: (2025)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
par: Pinsker, Michael, et autres
Publié: (2025)

Domains, Information Frames, Rough Sets: An Equivalence of Categories
par: Spreen, Dieter
Publié: (2025)

On the Computability of Measures of Regular Sets of Infinite Trees
par: Niwiński, Damian, 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)

Localized Attractor Computations for Infinite-State Games (Full Version)
par: Schmuck, Anne-Kathrin, et autres
Publié: (2024)

Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics
par: Lyon, Tim S.
Publié: (2023)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
par: Afshari, Bahareh, et autres
Publié: (2024)

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

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

Synthesis of Infinite State Systems
par: Drucker, Ohad, et autres
Publié: (2025)

Parameterized Infinite-State Reactive Synthesis
par: Maderbacher, Benedikt, et autres
Publié: (2025)

Explanations for Unrealizability of Infinite-State Safety Shields
par: Rodriguez, Andoni, et autres
Publié: (2025)

Towards Learning Infinite SMT Models (Work in Progress)
par: Janota, Mikoláš, et autres
Publié: (2025)

Infinite State Model Checking by Learning Transitive Relations
par: Frohn, Florian, et autres
Publié: (2025)

Infinite Traces by Finality: a Sheaf-Theoretic Approach
par: Peressotti, Marco
Publié: (2025)

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

Modular Attractor Acceleration in Infinite-State Games (Full Version)
par: Heim, Philippe, et autres
Publié: (2026)

Asynchronous Composition of LTL Properties over Infinite and Finite Traces
par: Bombardelli, Alberto, et autres
Publié: (2023)

List types for resource aware languages: an implicit name approach
par: Ghilezan, Silvia, et autres
Publié: (2021)

Bijective proofs for Eulerian numbers of types B and D
par: Santocanale, Luigi
Publié: (2021)

Gödel-McKinsey-Tarski and (not quite) Blok-Esakia for Heyting-Lewis Implication
par: de Groot, Jim, et autres
Publié: (2021)

Duality for Normal Lattice Expansions and Sorted, Residuated Frames with Relations
par: Hartonas, Chrysafis
Publié: (2021)

Cyclic Implicit Complexity
par: Curzi, Gianluca, et autres
Publié: (2021)

The Pebble-Relation Comonad in Finite Model Theory
par: Montacute, Yoàv, et autres
Publié: (2021)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
par: Oda, Yukihiro, et autres
Publié: (2021)

Dynamic Cantor Derivative Logic
par: Fernández-Duque, David, et autres
Publié: (2021)

On Small Types in Univalent Foundations
par: de Jong, Tom, et autres
Publié: (2021)

Universal Horn Sentences and the Joint Embedding Property
par: Bodirsky, Manuel, et autres
Publié: (2021)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
par: Livson, Ori, et autres
Publié: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
par: Oda, Yukihiro
Publié: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
par: Gaßner, Christine
Publié: (2025)

Demystifying $μ$
par: Afshari, Bahareh, et autres
Publié: (2024)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
par: Artale, Alessandro, et autres
Publié: (2025)

Proof-theoretic Semantics for Second-order Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

Many-valued coalgebraic dynamic logics: Safety and strong completeness via reducibility
par: Hansen, Helle Hvid, et autres
Publié: (2025)

Generalized Decidability via Brouwer Trees
par: de Jong, Tom, et autres
Publié: (2026)

Constructive higher sheaf models with applications to synthetic mathematics
par: Coquand, Thierry, et autres
Publié: (2026)