Imagen de Portada

On the Computability of Measures of Regular Sets of Infinite Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Niwiński, Damian, Parys, Paweł, Skrzypczak, Michał
Formato:	Preprint
Publicado:	2023
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

A Dichotomy Theorem for Ordinal Ranks in MSO
por: Niwiński, Damian, et al.
Publicado: (2025)

Generalised Quantifiers Based on Rabin-Mostowski Index
por: Kuperberg, Denis, et al.
Publicado: (2026)

Subsumption in $\mathcal{FL}_{\bot \mathit{reg}}$ with TBoxes Is in ExpTime
por: Henne, Michał, et al.
Publicado: (2026)

Positionality in $Σ_0^2$ and a completeness result
por: Ohlmann, Pierre, et al.
Publicado: (2023)

Partially Finite Model Reasoning in Description Logics Extended Version
por: Gogacz, Tomasz, et al.
Publicado: (2026)

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

Synthesis of Computable Regular Functions of Infinite Words
por: Dave, V., et al.
Publicado: (2019)

Tabular intermediate logics comparison
por: Rzążewski, Paweł, et al.
Publicado: (2025)

Infinite trees
por: Goy, Alexandre
Publicado: (2025)

Computing measures of weak-MSO definable sets of trees
por: Niwiński, Damian, et al.
Publicado: (2024)

Colimit-Based Composition of High-Level Computing Devices
por: Arellanes, Damian
Publicado: (2026)

Localized Attractor Computations for Infinite-State Games (Full Version)
por: Schmuck, Anne-Kathrin, et al.
Publicado: (2024)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
por: Pinsker, Michael, et al.
Publicado: (2025)

Models of High-Level Computation
por: Arellanes, Damian
Publicado: (2024)

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

A note on Stone-Čech compactification in ZFA
por: Przybyłek, Michał R.
Publicado: (2023)

Dependence Logics in Temporal Settings
por: Baltag, Alexandru, et al.
Publicado: (2022)

Synthesis of Infinite State Systems
por: Drucker, Ohad, et al.
Publicado: (2025)

Solving SAT By Computing A Stable Set Of Points In Clusters
por: Goldberg, Eugene
Publicado: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
por: Przybocki, Benjamin, et al.
Publicado: (2025)

T-BAT semantics and its logics
por: Pawlowski, Pawel
Publicado: (2025)

Parameterized Infinite-State Reactive Synthesis
por: Maderbacher, Benedikt, et al.
Publicado: (2025)

Compositional Control-Driven Boolean Circuits
por: Arellanes, Damian
Publicado: (2025)

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
por: Demri, Stephane, et al.
Publicado: (2023)

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
por: Gratzer, Daniel, et al.
Publicado: (2024)

Explanations for Unrealizability of Infinite-State Safety Shields
por: Rodriguez, Andoni, et al.
Publicado: (2025)

Monadic Second-Order Logic of Permutations
por: Jelínek, Vít, et al.
Publicado: (2025)

Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
por: Takahashi, Yuta
Publicado: (2024)

Towards Learning Infinite SMT Models (Work in Progress)
por: Janota, Mikoláš, et al.
Publicado: (2025)

Infinite State Model Checking by Learning Transitive Relations
por: Frohn, Florian, et al.
Publicado: (2025)

Infinite Traces by Finality: a Sheaf-Theoretic Approach
por: Peressotti, Marco
Publicado: (2025)

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

The complete classification for quantified equality constraints
por: Zhuk, Dmitriy, et al.
Publicado: (2021)

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

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

Asynchronous Composition of LTL Properties over Infinite and Finite Traces
por: Bombardelli, Alberto, et al.
Publicado: (2023)

Modular Attractor Acceleration in Infinite-State Games (Full Version)
por: Heim, Philippe, et al.
Publicado: (2026)

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

Regular Typed Unification
por: Barbosa, João, et al.
Publicado: (2024)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
por: Atserias, Albert, et al.
Publicado: (2024)