Cover Image

On the Computability of Measures of Regular Sets of Infinite Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Niwiński, Damian, Parys, Paweł, Skrzypczak, Michał
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

Infinite trees
by: Goy, Alexandre
Published: (2025)

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

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

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

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

Models of High-Level Computation
by: Arellanes, Damian
Published: (2024)

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

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

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Synthesis of Infinite State Systems
by: Drucker, Ohad, et al.
Published: (2025)

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

T-BAT semantics and its logics
by: Pawlowski, Pawel
Published: (2025)

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

Compositional Control-Driven Boolean Circuits
by: Arellanes, Damian
Published: (2025)

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

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

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

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

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

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

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

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

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

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

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

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

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

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

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

Algorithmic Problems for Computation Trees
by: Moshkov, Mikhail
Published: (2025)

Regular Typed Unification
by: Barbosa, João, et al.
Published: (2024)

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