By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly complete axiomatization for several systems of this kind having the range of the predicate variables as a parameter. The completeness argument uses simple techniques from the theory of Boolean algebras
Second-order logic, it has been alleged by W. V. Quine [17], is nothing but set theory in disguise, ...
In this paper, we will present a definability theorem for first order logic.This theorem is very eas...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
Second-order logic is the extension of first-order logic obtaining by introducing quantification of...
AbstractWe introduce a restricted version of second order logic SOωin which the second order quantif...
AbstractWe investigate the expressive power of second-order logic over finite structures, when two l...
In so-called full second-order logic, the second-order variables range over all subsets and relation...
AbstractWe investigate the expressive power of second-order logic over finite structures, when two l...
AbstractWe introduce a restricted version of second order logic SOωin which the second order quantif...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We define a weak second--order extension of first--order logic. We prove a second--order cut elimina...
Intensional sets, i.e., sets given by a property rather than by enumerating elements, are widely re...
We consider sl-semantics in which first order sentences are interpreted in potentially infinite doma...
Standard (classical) logic is not independent of set theory. Which formulas are valid in logic depen...
Second-order logic, it has been alleged by W. V. Quine [17], is nothing but set theory in disguise, ...
In this paper, we will present a definability theorem for first order logic.This theorem is very eas...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...
Second-order logic is the extension of first-order logic obtaining by introducing quantification of...
AbstractWe introduce a restricted version of second order logic SOωin which the second order quantif...
AbstractWe investigate the expressive power of second-order logic over finite structures, when two l...
In so-called full second-order logic, the second-order variables range over all subsets and relation...
AbstractWe investigate the expressive power of second-order logic over finite structures, when two l...
AbstractWe introduce a restricted version of second order logic SOωin which the second order quantif...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We define a weak second--order extension of first--order logic. We prove a second--order cut elimina...
Intensional sets, i.e., sets given by a property rather than by enumerating elements, are widely re...
We consider sl-semantics in which first order sentences are interpreted in potentially infinite doma...
Standard (classical) logic is not independent of set theory. Which formulas are valid in logic depen...
Second-order logic, it has been alleged by W. V. Quine [17], is nothing but set theory in disguise, ...
In this paper, we will present a definability theorem for first order logic.This theorem is very eas...
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite tree...