Results 1  10
of
2,171
Spectra of Monadic SecondOrder Formulas with One Unary Function
 In LICS’03
, 2003
"... We establish the eventual periodicity of the spectrum of any monadic secondorder formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one function symbol and that symbol is unary. ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We establish the eventual periodicity of the spectrum of any monadic secondorder formula where (i) all relation symbols, except equality, are unary, and (ii) there is only one function symbol and that symbol is unary.
On the modelchecking of monadic secondorder formulas with edge set quantifications
, 2010
"... ..."
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
scheme. In chapter 3 we list the qanalogues of the polynomials in the Askeyscheme. We give their definition, orthogonality relation, three term recurrence relation, second order di#erence equation, forward and backward shift operator, Rodriguestype formula and generating functions. In chapter 4 we give the limit
HR ∗ Graph Conditions Between Counting Monadic SecondOrder and SecondOrder Graph Formulas
"... Abstract: Graph conditions are a means to express structural properties for graph transformation systems and graph programs in a large variety of application areas. With HR ∗ graph conditions, nonlocal graph properties like “there exists a path of arbitrary length ” or “the graph is circlefree ” c ..."
Abstract
 Add to MetaCart
free ” can be expressed. We show, by induction over the structure of formulas and conditions, that (1) any nodecounting monadic secondorder formula can be expressed by an HR ∗ condition and (2) any HR ∗ condition can be expressed by a secondorder graph formula.
From the spectrum to inflation: A second order inverse formula for the general slowroll spectrum
 JCAP
, 2006
"... We invert the second order, single field, general slowroll formula for the power spectrum, to obtain a second order formula for inflationary parameters in terms of the primordial power spectrum. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We invert the second order, single field, general slowroll formula for the power spectrum, to obtain a second order formula for inflationary parameters in terms of the primordial power spectrum.
The monadic secondorder logic of graphs XV: On a Conjecture by D. Seese
 Journal of Applied Logic
, 2006
"... A conjecture by D. Seese states that if a set of graphs has a decidable monadic secondorder theory, then it is the image of a set of trees under a transformation defined by monadic secondorder formulas. We prove that the general case of this conjecture is equivalent to the particular cases of dire ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
A conjecture by D. Seese states that if a set of graphs has a decidable monadic secondorder theory, then it is the image of a set of trees under a transformation defined by monadic secondorder formulas. We prove that the general case of this conjecture is equivalent to the particular cases
The modular decomposition of countable graphs: Constructions in Monadic SecondOrder Logic
 IN COMPUTER SCIENCE LOGIC 2005, VOLUME 3634 OF OXFORD, LEC. NOTES COMPUT. SCI
, 2005
"... We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic SecondOrder logic. A second main result is the definition of a representation of modular decompositions by a low degree relational st ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic SecondOrder logic. A second main result is the definition of a representation of modular decompositions by a low degree relational
The Evaluation of FirstOrder Substitution is Monadic SecondOrder Compatible
"... We denote firstorder substitutions of finite and infinite terms by function symbols indexed by the sequences of firstorder variables to which substitutions are made. We consider the evaluation mapping from infinite terms to infinite terms that evaluates these substitution operations. This mapping ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
and variables, a monadic secondorder formula expressing a property of the output term produced by the evaluation mapping can be translated into a monadic secondorder formula expressing this property over the input term. This implies that, deciding the monadic secondorder theory of the output term reduces
Results 1  10
of
2,171