Deciding Predicate Logical Theories of Real-Valued Functions
Fuente:
arXiv
Saved in:
| Main Author: | Ratschan, Stefan |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Applications of Quantified Constraint Solving over the Reals -- Bibliography
by: Ratschan, Stefan
Published: (2012)
by: Ratschan, Stefan
Published: (2012)
On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)
by: Berthé, Valérie, et al.
Published: (2024)
Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem
by: Lipparini, Enrico, et al.
Published: (2023)
by: Lipparini, Enrico, et al.
Published: (2023)
SMT and Functional Equation Solving over the Reals: Challenges from the IMO
by: Brown, Chad E., et al.
Published: (2025)
by: Brown, Chad E., et al.
Published: (2025)
Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)
by: Tokuo, Kenji
Published: (2026)
Inductive Satisfiability Certification for Universal Quantifiers and Uninterpreted Function Symbols
by: Ratschan, Stefan, et al.
Published: (2026)
by: Ratschan, Stefan, et al.
Published: (2026)
Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)
by: Chopoghloo, Somayeh, et al.
Published: (2024)
Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)
Efficient Solving of Quantified Inequality Constraints over the Real Numbers
by: Ratschan, Stefan
Published: (2002)
by: Ratschan, Stefan
Published: (2002)
Input-based Three-valued Abstraction Refinement
by: Onderka, Jan, et al.
Published: (2024)
by: Onderka, Jan, et al.
Published: (2024)
Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)
by: Artale, Alessandro, et al.
Published: (2025)
Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)
by: Su, Wanyun, et al.
Published: (2024)
Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
by: Li, Yongming
Published: (2025)
by: Li, Yongming
Published: (2025)
Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)
by: Gamsakhurdia, Mariami, et al.
Published: (2025)
Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)
by: Benedikt, Michael, et al.
Published: (2024)
The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)
by: Barloy, Corentin, et al.
Published: (2025)
Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
by: Kurucz, Agi, et al.
Published: (2023)
by: Kurucz, Agi, et al.
Published: (2023)
Logical Predicates in Higher-Order Mathematical Operational Semantics
by: Goncharov, Sergey, et al.
Published: (2024)
by: Goncharov, Sergey, et al.
Published: (2024)
Deciding Boolean Separation Logic via Small Models (Technical Report)
by: Dacík, Tomáš, et al.
Published: (2024)
by: Dacík, Tomáš, et al.
Published: (2024)
Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)
by: Hieronymi, Philipp, et al.
Published: (2021)
Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)
by: van Gool, Sam, et al.
Published: (2023)
Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)
by: de Jong, Tom, et al.
Published: (2026)
Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories
by: Hofmann, Till, et al.
Published: (2024)
by: Hofmann, Till, et al.
Published: (2024)
The Boolean Solution Problem from the Perspective of Predicate Logic -- Extended Version
by: Wernhard, Christoph
Published: (2017)
by: Wernhard, Christoph
Published: (2017)
A Dual-Threshold Probabilistic Knowing Value Logic
by: Wang, Shanxia
Published: (2026)
by: Wang, Shanxia
Published: (2026)
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
by: Elad, Neta, et al.
Published: (2026)
by: Elad, Neta, et al.
Published: (2026)
Predicate Subtypes in VerCors
by: Dubbeling, Tycho, et al.
Published: (2026)
by: Dubbeling, Tycho, et al.
Published: (2026)
Deciding the Value of Two-Clock Almost Non-Zeno Weighted Timed Games
by: Vialard, Isa
Published: (2025)
by: Vialard, Isa
Published: (2025)
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
by: Pratt-Hartmann, Ian
Published: (2017)
by: Pratt-Hartmann, Ian
Published: (2017)
A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
by: Joshi, Varad, et al.
Published: (2025)
by: Joshi, Varad, et al.
Published: (2025)
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
by: Haase, Christoph, et al.
Published: (2024)
by: Haase, Christoph, et al.
Published: (2024)
Proof Theory and Decision Procedures for Deontic STIT Logics
by: Lyon, Tim S., et al.
Published: (2024)
by: Lyon, Tim S., et al.
Published: (2024)
Learning Temporal Logic Predicates from Data with Statistical Guarantees
by: Soroka, Emi, et al.
Published: (2024)
by: Soroka, Emi, et al.
Published: (2024)
Many-Valued Modal Logic
by: Karniel, Amir, et al.
Published: (2024)
by: Karniel, Amir, et al.
Published: (2024)
Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)
by: Ayhan, Sara, et al.
Published: (2025)
Model Predictive Robustness of Signal Temporal Logic Predicates
by: Lin, Yuanfei, et al.
Published: (2022)
by: Lin, Yuanfei, et al.
Published: (2022)
Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System
by: Gupta, Gopal, et al.
Published: (2025)
by: Gupta, Gopal, et al.
Published: (2025)
Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs
by: Ito, Sohei, et al.
Published: (2026)
by: Ito, Sohei, et al.
Published: (2026)
Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)
by: Lutz, Carsten, et al.
Published: (2024)
Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)
by: Feller, Thomas, et al.
Published: (2023)
Similar Items
-
Applications of Quantified Constraint Solving over the Reals -- Bibliography
by: Ratschan, Stefan
Published: (2012) -
On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024) -
Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem
by: Lipparini, Enrico, et al.
Published: (2023) -
SMT and Functional Equation Solving over the Reals: Challenges from the IMO
by: Brown, Chad E., et al.
Published: (2025) -
Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)