We prove that the three extensions of first-order logic by means of positive inductions, monotone inductions, and so-called non-monotone (in our terminology, inflationary) inductions respectively, all have the same expressive power in the case of finite structures.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26387/1/0000474.pd
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
AbstractWe consider extensions of first order logic (FO) and fixed point logic (FP) by means of gene...
AbstractWe consider extensions of first order logic (FO) and fixed point logic (FP) by means of gene...
Deficiency in expressive power of the first-order logic has led to developing its numerous extension...
We prove that first order logic is strictly weaker than fixed point logic over every infinite classe...
In recent years several extensions of first-order logic have been investigated in the context of fin...
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite st...
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite st...
Descriptive complexity aims to classify properties of finite structures according to the logical res...
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite st...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
AbstractWe consider extensions of first order logic (FO) and fixed point logic (FP) by means of gene...
AbstractWe consider extensions of first order logic (FO) and fixed point logic (FP) by means of gene...
Deficiency in expressive power of the first-order logic has led to developing its numerous extension...
We prove that first order logic is strictly weaker than fixed point logic over every infinite classe...
In recent years several extensions of first-order logic have been investigated in the context of fin...
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite st...
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite st...
Descriptive complexity aims to classify properties of finite structures according to the logical res...
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite st...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only a...
DOI
Add to ORKG