AbstractThis paper gives some new logical characterizations of the class of rudimentary languages in the scope of descriptive complexity. These characterizations are based on a logic introduced by Parigot and Pelz to characterize Petri Net languages, and generalized quantifiers of comparison of cardinality
book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would l...
We investigate an imperative and a functional programming language. The computational power of fragm...
We characterize various complexity classes as the images in set$ sp2,$ set$ sp{V},$ and set$ sp3$ of...
AbstractElementary computations over relational structures give rise to computable relations definab...
In this article we review some of the main results of descriptive complexity theory in order to make...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
Exploration of the connections between computational complexity, descriptive complexity, and logic r...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
New connections are discovered between formal language theory and model theory. We give logical char...
We describe three orthogonal complexity measures: parallel time, amount of hardware, and degree of n...
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of...
The proceedings contain 24 papers. The special focus in this conference is on Descriptional Complexi...
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whe...
Bounded arithmetic is a branch of mathematical logic which characterize various classes of computati...
International audienceIn this paper an implicit characterization of the complexity classes kEXP and ...
book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would l...
We investigate an imperative and a functional programming language. The computational power of fragm...
We characterize various complexity classes as the images in set$ sp2,$ set$ sp{V},$ and set$ sp3$ of...
AbstractElementary computations over relational structures give rise to computable relations definab...
In this article we review some of the main results of descriptive complexity theory in order to make...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
Exploration of the connections between computational complexity, descriptive complexity, and logic r...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
New connections are discovered between formal language theory and model theory. We give logical char...
We describe three orthogonal complexity measures: parallel time, amount of hardware, and degree of n...
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of...
The proceedings contain 24 papers. The special focus in this conference is on Descriptional Complexi...
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whe...
Bounded arithmetic is a branch of mathematical logic which characterize various classes of computati...
International audienceIn this paper an implicit characterization of the complexity classes kEXP and ...
book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would l...
We investigate an imperative and a functional programming language. The computational power of fragm...
We characterize various complexity classes as the images in set$ sp2,$ set$ sp{V},$ and set$ sp3$ of...
DOI
Add to ORKG