Results 1  10
of
167
Expressing cardinality quantifiers in monadic secondorder logic over chains
 J. Symb. Log
"... Abstract. We study an extension of monadic secondorder logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic secondorder logic of order. Addi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We study an extension of monadic secondorder logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic secondorder logic of order
One Quantifier Will Do in Existential Monadic SecondOrder Logic over Pictures
, 1998
"... . We show that every formula of the existential fragment of monadic secondorder logic over picture models (i.e., finite, twodimensional, coloured grids) is equivalent to one with only one existential monadic quantifier. The corresponding claim is true for the class of word models ([Tho82]) but not ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. We show that every formula of the existential fragment of monadic secondorder logic over picture models (i.e., finite, twodimensional, coloured grids) is equivalent to one with only one existential monadic quantifier. The corresponding claim is true for the class of word models ([Tho82
FIRST ORDER QUANTIFIERS IN MONADIC SECOND ORDER LOGIC
"... Abstract. This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01]. We introduce an operation existsn(S) on properties S that says “there are n components having S”. We use th ..."
Abstract
 Add to MetaCart
Abstract. This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01]. We introduce an operation existsn(S) on properties S that says “there are n components having S”. We use
Ordering Constraints over Feature Trees Expressed in Secondorder Monadic Logic
 Information and Computation
, 1998
"... The language FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. While the firstorder theory of FT is well understood, only few decidability results are known for the firstorder theory of FT . We introduc ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
one can change the model towards sufficiently labeled feature trees  a class of trees that we introduce. As we show, the first ordertheory of ordering constraints over sufficiently labeled feature trees is equivalent to secondorder monadic logic (S2S for infinite and WS2S for finite feature
Parikh Automata and Monadic SecondOrder Logics with Linear Cardinality Constraints
, 2002
"... We study extensions of weak monadic secondorder logics on words and trees with linear cardinality constraints of the form X_1 + ... + X_r < Y_1 + ... + Y_s; where the X_i s and Y_j s are monadic secondorder (MSO) variables. Although these logics are undecidable in general, we identify d ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We study extensions of weak monadic secondorder logics on words and trees with linear cardinality constraints of the form X_1 + ... + X_r < Y_1 + ... + Y_s; where the X_i s and Y_j s are monadic secondorder (MSO) variables. Although these logics are undecidable in general, we identify
New Algorithm for Weak Monadic SecondOrder Logic on Inductive Structures
"... Abstract. We present a new algorithm for modelchecking weak monadic secondorder logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipulates formulas and checks them on the structure of interest, thus avoiding both the use of automata and the nee ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We present a new algorithm for modelchecking weak monadic secondorder logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipulates formulas and checks them on the structure of interest, thus avoiding both the use of automata
Guarded SecondOrder Logic, Spanning Trees, and Network Flows
 Logical Methods in Computer Science
"... Abstract. According to a theorem of Courcelle monadic secondorder logic and guarded secondorder logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable ksparse hypergraphs. In the first part of the present paper we extend this result t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. According to a theorem of Courcelle monadic secondorder logic and guarded secondorder logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable ksparse hypergraphs. In the first part of the present paper we extend this result
The Undecidability of Second Order Multiplicative Linear Logic
, 1996
"... The multiplicative fragment of second order propositional linear logic is shown to be undecidable. Introduction Decision problems for propositional (quantifierfree) linear logic were first studied by Lincoln et al. [LMSS]. In referring to linear logic fragments, let M stand for multiplicatives, A ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The multiplicative fragment of second order propositional linear logic is shown to be undecidable. Introduction Decision problems for propositional (quantifierfree) linear logic were first studied by Lincoln et al. [LMSS]. In referring to linear logic fragments, let M stand for multiplicatives, A
Characterizing Definability of SecondOrder Generalized Quantifiers
"... We study definability of secondorder generalized quantifiers. We show that the question whether a secondorder generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic secondorder logic, reduces to the question if a quantifier Q ⋆ 1 is definable in FO ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study definability of secondorder generalized quantifiers. We show that the question whether a secondorder generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic secondorder logic, reduces to the question if a quantifier Q ⋆ 1 is definable
The Undecidability of Second Order Multiplicative Linear Logic
, 1996
"... The multiplicative fragment of second order propositional linear logic is shown to be undecidable. Introduction Decision problems for propositional (quantifierfree) linear logic were first studied by Lincoln et al. [LMSS]. In referring to linear logic fragments, let M stand for multiplicatives, A ..."
Abstract
 Add to MetaCart
The multiplicative fragment of second order propositional linear logic is shown to be undecidable. Introduction Decision problems for propositional (quantifierfree) linear logic were first studied by Lincoln et al. [LMSS]. In referring to linear logic fragments, let M stand for multiplicatives, A
Results 1  10
of
167