184 citations · 617 across the 22 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.LO2009
Complex Algebras of Arithmetic
Ivo Düntsch, Ian Pratt-Hartmann
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circu…
cs.LO2009
Functions Definable by Numerical Set-Expressions
Ian Pratt-Hartmann, Ivo Düntsch
A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined…
cs.LO2009★ 44 cited
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
Yevgeny Kazakov, Ian Pratt-Hartmann
Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possib…