Sciweavers

227 search results - page 18 / 46
» Second-order logic on equivalence relations
Sort
View
PODS
2010
ACM
205views Database» more  PODS 2010»
14 years 17 days ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
JANCL
2007
86views more  JANCL 2007»
13 years 7 months ago
Dynamic logics of the region-based theory of discrete spaces
The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discr...
Philippe Balbiani, Tinko Tinchev, Dimiter Vakarelo...
RTA
2004
Springer
14 years 25 days ago
Rewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Herman Geuvers, Rob Nederpelt
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 7 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
ACTA
1998
64views more  ACTA 1998»
13 years 7 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo