A predicative and decidable characterization of the polynomial classes of languages (original) (raw)
Related papers
A Robust Class of Regular Languages
Lecture Notes in Computer Science
Incomplete Transition Complexity of Basic Operations on Finite Languages
Lecture Notes in Computer Science, 2013
Separating Notions of Higher-Type Polynomial-Time
2000
The parameterized complexity of some problems in logic and linguistics
Lecture Notes in Computer Science, 1994
Definability and fast quantifier elimination in algebraically closed fields
Theoretical Computer Science, 1983
Belief, provability, and logic programs
Journal of Applied Non-Classical Logics, 1995
Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities
Logical Methods, 1993
Non-deterministic Semantics in Polynomial Format
Electronic Notes in Theoretical Computer Science, 2014
Notes on Formal Theories of Truth
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1989
1994
Higher Order Languages and Logical Truth
2013
David Hilbert's Lectures on the Foundations of Arithmetic and Logic 1917-1933, 2013
Introduction: The problem of language complexity
Studies in Language Companion Series, 2008
ALLTYPES: An algebraic language and TYPE system
Artificial Intelligence and Symbolic Computation, 1998
2011
From quantification to reduction
2017
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables
Journal of Logic and Analysis
1980
1984
1998
Bulletin of Symbolic Logic, 2010
Existential definability and diophantine stability
arXiv (Cornell University), 2022
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP '13, 2013
On Tarski's Decidability Problem: Response to Sela's Report
arXiv (Cornell University), 2014
Computably Categorical Fields via Fermat’s Last Theorem
2014
On the semi-perfect elimination
Advances in Applied Mathematics, 1988
Journal of Zhejiang University SCIENCE C, 2013
A New Discourse on Undecideability and Proof Systems
2010
The Three Degrees of Definiteness
Annual Meeting of the Berkeley Linguistics Society, 2014
The eskolemization of universal quantifiers
Annals of Pure and Applied Logic, 2010
Yet Another Programming Exercises Interoperability Language (Short Paper)
2020
Model-Theoretic Characterization of Complexity Classes
Electronic Colloquium on Computational Complexity, 2009
Kalmár Workshop on Logic and Computer Science --- Preface
2007
Some Challenging Typing Issues in Object-Oriented Languages
Electronic Notes in Theoretical Computer Science, 2003