AbstractIn this paper, we introduce and study some syntactical fragments of monadic second-order and first-order (PEANO) arithmetic which we will prove the connection to famous complexity classes. Starting from descriptive complexity results, and giving an effective method for translating formulas between different logical structures representing encodings of integers, we give some new arithmetical characterizations of NP, PH, NL, and P
We introduce a new framework for a descriptive complexity approach to arithmetic computations. We de...
AbstractSeveral authors have independently introduced second order theories whose provably total fun...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
AbstractIn this paper, we introduce and study some syntactical fragments of monadic second-order and...
AbstractElementary computations over relational structures give rise to computable relations definab...
This paper considers a number of arithmetic theories and shows how the strength of these theories re...
AbstractVarious sets of Turing machines naturally occuring in the theory of computational complexity...
In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for...
In this article we review some of the main results of descriptive complexity theory in order to make...
AbstractWe define theories of bounded arithmetic, whose definable functions and relations are exactl...
Abstract: "In this paper we characterize the well-known computational complexity classes of the poly...
This thesis is composed of three separate, yet related strands. They have in common the notion that...
AbstractA structure with base set N is complete with respect to the first-order definability in the ...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We derive upper and lower bounds on the computational complexity of prefix classes of several logica...
We introduce a new framework for a descriptive complexity approach to arithmetic computations. We de...
AbstractSeveral authors have independently introduced second order theories whose provably total fun...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
AbstractIn this paper, we introduce and study some syntactical fragments of monadic second-order and...
AbstractElementary computations over relational structures give rise to computable relations definab...
This paper considers a number of arithmetic theories and shows how the strength of these theories re...
AbstractVarious sets of Turing machines naturally occuring in the theory of computational complexity...
In spite of the fact that a great deal of effort has been expended trying to prove lower bounds for...
In this article we review some of the main results of descriptive complexity theory in order to make...
AbstractWe define theories of bounded arithmetic, whose definable functions and relations are exactl...
Abstract: "In this paper we characterize the well-known computational complexity classes of the poly...
This thesis is composed of three separate, yet related strands. They have in common the notion that...
AbstractA structure with base set N is complete with respect to the first-order definability in the ...
AbstractIt is a well-known result of Fagin that the complexity class NP coincides with the class of ...
We derive upper and lower bounds on the computational complexity of prefix classes of several logica...
We introduce a new framework for a descriptive complexity approach to arithmetic computations. We de...
AbstractSeveral authors have independently introduced second order theories whose provably total fun...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
DOI
Add to ORKG