Imagen de Portada

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Akshay, S., Bazille, Hugo, Genest, Blaise, Vahanwala, Mihir
Formato:	Preprint
Publicado:	2022
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

Skolem and Positivity Completeness of Ergodic Markov Chains
por: Vahanwala, Mihir
Publicado: (2023)

Formal Reasoning About Confidence and Automated Verification of Neural Networks
por: Afzal, Mohammad, et al.
Publicado: (2025)

Skolemization In Intermediate Logics
por: Baaz, Matthias, et al.
Publicado: (2025)

Automata on $S$-adic words
por: Berthé, Valérie, et al.
Publicado: (2025)

The Monadic Theory of Toric Words
por: Berthé, Valérie, et al.
Publicado: (2023)

On the Complexity of the Skolem Problem at Low Orders
por: Bacik, Piotr, et al.
Publicado: (2025)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
por: Bacik, Piotr, et al.
Publicado: (2026)

The Skolem Problem in rings of positive characteristic
por: Dong, Ruiwen, et al.
Publicado: (2025)

On the Decidability of Monadic Theories of Arithmetic Predicates
por: Berthé, Valérie, et al.
Publicado: (2024)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
por: Przybocki, Benjamin, et al.
Publicado: (2024)

An Approximate Skolem Function Counter
por: Shaw, Arijit, et al.
Publicado: (2023)

Model Checking Markov Chains as Distribution Transformers
por: Aghamov, Rajab, et al.
Publicado: (2024)

Petri Nets and Higher-Dimensional Automata
por: Amrane, Amazigh, et al.
Publicado: (2025)

On the Counting Complexity of the Skolem Problem
por: Jindal, Gorav, et al.
Publicado: (2024)

Implication Problems over Positive Semirings
por: Hirvonen, Minna
Publicado: (2025)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
por: Gamsakhurdia, Mariami, et al.
Publicado: (2025)

On the $p$-adic Skolem Problem
por: Bacik, Piotr, et al.
Publicado: (2025)

Logic and Languages of Higher-Dimensional Automata
por: Amrane, Amazigh, et al.
Publicado: (2024)

Variants of Higher-Dimensional Automata
por: Bazille, Hugo, et al.
Publicado: (2026)

Tree Rewriting Calculi for Strictly Positive Logics
por: Santiago-Fernández, Sofía, et al.
Publicado: (2025)

Blurred Drinker Paradoxes and Blurred Choice Axioms: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem Theorem
por: Kirst, Dominik, et al.
Publicado: (2026)

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
por: Chatterjee, Krishnendu, et al.
Publicado: (2024)

Higher-Dimensional Timed Automata for Real-Time Concurrency
por: Amrane, Amazigh, et al.
Publicado: (2024)

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

Positive Almost-Sure Termination of Polynomial Random Walks
por: Winkler, Lorenz, et al.
Publicado: (2025)

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

Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure
por: Nakamura, Yoshiki
Publicado: (2024)

Positive First-order Logic on Words and Graphs
por: Kuperberg, Denis
Publicado: (2022)

New Bounds for the Ideal Proof System in Positive Characteristic
por: Behera, Amik Raj, et al.
Publicado: (2025)

Positive Sharing and Abstract Machines
por: Accattoli, Beniamino, et al.
Publicado: (2025)

Positive Focusing is Directly Useful
por: Accattoli, Beniamino, et al.
Publicado: (2024)

Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators
por: Kikot, Stanislav, et al.
Publicado: (2017)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
por: Herbelin, Hugo
Publicado: (2024)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
por: Kassing, Jan-Christoph, et al.
Publicado: (2026)

The Discontinuity Problem
por: Brattka, Vasco
Publicado: (2020)

Unified Fairness for Weak Memory Verification
por: Abdulla, Parosh Aziz, et al.
Publicado: (2023)

Positivity-hardness results on Markov decision processes
por: Piribauer, Jakob, et al.
Publicado: (2023)

Pitts and Intuitionistic Multi-Succedent: Uniform Interpolation for KM
por: Férée, Hugo, et al.
Publicado: (2026)

Deciding subspace reachability problems with application to Skolem's Problem
por: Everett, Samuel
Publicado: (2024)

Problems and Consequences of Bilateral Notions of (Meta-)Derivability
por: Ayhan, Sara
Publicado: (2025)