Results 1  10
of
106
On Monadic Theories of Monadic Predicates
"... For Yuri Gurevich on the occasion of his 70th birthday Abstract. Pioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic secondorder logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the su ..."
Abstract
 Add to MetaCart
For Yuri Gurevich on the occasion of his 70th birthday Abstract. Pioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic secondorder logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory
On decidability of monadic logic of order over the naturals extended by monadic predicates
, 2007
"... ..."
On compositionality and its limitations Alexander Rabinovich Tel Aviv University
"... The aim of this paper is to examine the applicability of a compositional method developed for a generalized product construction by Feferman and Vaught to the field of program verification. We suggest an instance of the generalized product construction and prove an appropriate composition theorem fo ..."
Abstract
 Add to MetaCart
The aim of this paper is to examine the applicability of a compositional method developed for a generalized product construction by Feferman and Vaught to the field of program verification. We suggest an instance of the generalized product construction and prove an appropriate composition theorem
On Countable Chains Having Decidable Monadic Theory
"... Rationals and countable ordinals are important examples of structures with decidable monadic secondorder theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic secondorder theory of a countable chain C is decidable then C has a nontrivial expansion ..."
Abstract
 Add to MetaCart
Rationals and countable ordinals are important examples of structures with decidable monadic secondorder theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic secondorder theory of a countable chain C is decidable then C has a nontrivial expansion
Definability in Rationals with Real Order in the Background
"... The paper deals with logically definable families of sets (or pointsets) of rational numbers. In particular we are interested whether the families definable over the real line with a unary predicate for the rationals are definable over the rational order alone. Let #(X, Y ) and #(Y ) range over for ..."
Abstract
 Add to MetaCart
Introduction We consider the monadic secondorder theory of linear order. For the s...
Counting on CTL*: On the Expressive Power of Monadic Path Logic
, 2003
"... Monadic secondorder logic (MSOL) provides a general framework for expressing properties of reactive systems as modelled by trees. Monadic path logic (MPL) is obtained by restricting secondorder quantification to paths reflecting computation sequences. In this paper we show that the expressive powe ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Monadic secondorder logic (MSOL) provides a general framework for expressing properties of reactive systems as modelled by trees. Monadic path logic (MPL) is obtained by restricting secondorder quantification to paths reflecting computation sequences. In this paper we show that the expressive
Decidable expansions of labelled linear orderings
, 2010
"... Let M =(A, <, P)where(A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type ω or −ω, and the monadic secondorder theory of M is decidable, then there exists a nontrivial expansion M ′ of M by a monadic pred ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let M =(A, <, P)where(A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type ω or −ω, and the monadic secondorder theory of M is decidable, then there exists a nontrivial expansion M ′ of M by a monadic
Definability in Rationals with Real Order in the Background
"... The paper deals with logically definable families of sets (or pointsets)ofrational numbers. In particular we are interested whether the families definable over the real line with a unary predicate for the rationals are definable over the rational order alone. Let #(X,Y )and#(Y ) range over formula ..."
Abstract
 Add to MetaCart
formulas in the firstorder monadic language of order. Let Q be the set of rationals and F be the family of subsets J of Q such that #(Q,J) holds over the real line. The question arises whether, for every #, F can be defined by means of an appropriate #(Y ) interpreted over the rational order. We answer
Definability and Undefinability with Real Order at the Background
"... We consider the monadic secondorder theory of linear order. For the sakeof brevity, linearly ordered sets will be called chains. Let A = hA !i be a chain. A formula OE(t) with one free individual variable t defines a pointset on A whichcontains the points of A that satisfy OE(t). As usually we ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We consider the monadic secondorder theory of linear order. For the sakeof brevity, linearly ordered sets will be called chains. Let A = hA !i be a chain. A formula OE(t) with one free individual variable t defines a pointset on A whichcontains the points of A that satisfy OE(t). As usually
EXPRESSING CARDINALITY QUANTIFIERS IN MONADIC SECONDORDER LOGIC OVER CHAINS
"... Abstract. We investigate the extension of monadic secondorder logic of order with cardinality quantifiers “there exists uncountably many sets such that... ” and “there exists continuum many sets such that...”. We prove that over the class of countable linear orders the two quantifiers are equivalen ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
of Shelah’s composition method and Ramseylike theorem for dense linear orders. §1. Introduction. The study of extensions of firstorder logic with cardinality quantifiers goes back to at least Mostowski [14]. For a cardinal κ the quantifier ∃ κ x asserts the existence of at least κ many elements with a
Results 1  10
of
106