Saved in:
| Main Authors: | Düntsch, Ivo, Pratt-Hartmann, Ian |
|---|---|
| Format: | Preprint |
| Published: |
2009
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/0911.5246 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Functions Definable by Numerical Set-Expressions
by: Pratt-Hartmann, Ian, et al.
Published: (2009)
by: Pratt-Hartmann, Ian, et al.
Published: (2009)
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2004)
by: Pratt-Hartmann, Ian
Published: (2004)
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
by: Pratt-Hartmann, Ian
Published: (2007)
by: Pratt-Hartmann, Ian
Published: (2007)
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2008)
by: Pratt-Hartmann, Ian
Published: (2008)
Discrete dualities for some algebras from rough sets
by: Düntsch, Ivo, et al.
Published: (2026)
by: Düntsch, Ivo, et al.
Published: (2026)
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)
by: Kazakov, Yevgeny, et al.
Published: (2009)
On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)
by: Jindal, Gorav, et al.
Published: (2024)
The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)
by: Pratt-Hartmann, Ian, et al.
Published: (2020)
On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
The Hamiltonian Syllogistic
by: Pratt-Hartmann, Ian
Published: (2010)
by: Pratt-Hartmann, Ian
Published: (2010)
On the Reachability Problem for One-Dimensional Thin Grammar Vector Addition Systems
by: Xue, Chengfeng, et al.
Published: (2026)
by: Xue, Chengfeng, et al.
Published: (2026)
On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)
by: Krajicek, Jan
Published: (2022)
Algebra of Self-Replication
by: Moss, Lawrence S.
Published: (2023)
by: Moss, Lawrence S.
Published: (2023)
A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)
by: Ong, Shawn, et al.
Published: (2025)
Hardness of busy beaver value BB(15)
by: Stérin, Tristan, et al.
Published: (2021)
by: Stérin, Tristan, et al.
Published: (2021)
Logics for the Relational Syllogistic
by: Pratt-Hartmann, Ian, et al.
Published: (2008)
by: Pratt-Hartmann, Ian, et al.
Published: (2008)
Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)
by: Pradic, Cécilia, et al.
Published: (2025)
How to Verify a Turing Machine with Dafny
by: Lederer, Edgar F. A.
Published: (2026)
by: Lederer, Edgar F. A.
Published: (2026)
Reactive Synthesis for Expected Impacts
by: Chini, Emanuele, et al.
Published: (2024)
by: Chini, Emanuele, et al.
Published: (2024)
Turing machines deciders, part I
by: The bbchallenge Collaboration, et al.
Published: (2025)
by: The bbchallenge Collaboration, et al.
Published: (2025)
Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)
by: Sanders, Sam
Published: (2023)
On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)
by: Normann, Dag, et al.
Published: (2024)
The Syllogistic with Unity
by: Pratt-Hartmann, Ian
Published: (2011)
by: Pratt-Hartmann, Ian
Published: (2011)
Cardinality and Representation of Stone Relation Algebras
by: Furusawa, Hitoshi, et al.
Published: (2023)
by: Furusawa, Hitoshi, et al.
Published: (2023)
Neural networks as fuzzy logic formulas
by: Heiman, Damian, et al.
Published: (2026)
by: Heiman, Damian, et al.
Published: (2026)
Place Bisimilarity is Decidable, Indeed!
by: Gorrieri, Roberto
Published: (2021)
by: Gorrieri, Roberto
Published: (2021)
Probabilistic Nets-within-Nets
by: Köhler-Bußmeier, Michael
Published: (2024)
by: Köhler-Bußmeier, Michael
Published: (2024)
On Equivalent Characterizations of NP in Abstract Models of Computation
by: Kirn, Jeremy C., et al.
Published: (2025)
by: Kirn, Jeremy C., et al.
Published: (2025)
A "Symbolic" Representation of Object-Nets (Extended Version)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)
by: Köhler-Bussmeier, Michael, et al.
Published: (2024)
On the computational properties of basic mathematical notions
by: Normann, Dag, et al.
Published: (2022)
by: Normann, Dag, et al.
Published: (2022)
Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)
by: Bujok, Maksymilian, et al.
Published: (2024)
Imperative process algebra and models of computation
by: Middelburg, C. A.
Published: (2022)
by: Middelburg, C. A.
Published: (2022)
The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)
by: Gorrieri, Roberto
Published: (2023)
Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)
by: Mathew, Prince, et al.
Published: (2026)
Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)
by: Aiswarya, C., et al.
Published: (2024)
Biochemical Computing Mode for Sequential Logic
by: Huang, Han, et al.
Published: (2025)
by: Huang, Han, et al.
Published: (2025)
PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)
by: Guttenberg, Roland, et al.
Published: (2025)
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)
by: Guttenberg, Roland, et al.
Published: (2025)
Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)
by: Aiswarya, C, et al.
Published: (2024)
The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
by: Backhouse, Roland, et al.
Published: (2023)
by: Backhouse, Roland, et al.
Published: (2023)
Similar Items
-
Functions Definable by Numerical Set-Expressions
by: Pratt-Hartmann, Ian, et al.
Published: (2009) -
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2004) -
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
by: Pratt-Hartmann, Ian
Published: (2007) -
Data-Complexity of the Two-Variable Fragment with Counting Quantifiers
by: Pratt-Hartmann, Ian
Published: (2008) -
Discrete dualities for some algebras from rough sets
by: Düntsch, Ivo, et al.
Published: (2026)