default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 113
Volume 113, Number 1-3, 27 December 2001
- Yuri V. Matiyasevich
:
Preface. 1- - Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith:
Complexity of t-tautologies. 3-11 - Danièle Beauquier, Anatol Slissenko:
A first order logic for specification of timed algorithms: basic properties and a decidable class. 13-52 - Anatoly Petrovich Beltiukov:
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete. 53-58 - Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri V. Matiyasevich:
Window-accumulated subsequence matching problem is linear. 59-80 - Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev:
MAX SAT approximation beyond the limits of polynomial-time approximation. 81-94 - Gennady Davydov, Inna Davydova:
Towards logical operations research - propositional case. 95-119 - Lew Gordeev:
Finite methods in 1-order formalisms. 121-151 - Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity of Null-and Positivstellensatz proofs. 153-160 - Rosalie Iemhoff:
A (nother) characterization of intuitionistic propositional logic. 161-173 - Nikolai Kossovski:
Computational complexity of quantifier-free negationless theory of field of rational numbers. 175-180 - Vladimir Krupski:
The single-conclusion proof logic and inference rules specification. 181-206 - Vladimir Lifschitz:
On calculational proofs. 207-224 - Grigori Mints:
Interpolation theorems for intuitionistic predicate logic. 225-242 - Valery Plisko:
Arithmetic complexity of the predicate logics of certain complete arithmetic theories. 243-259 - Nikolai A. Shanin:
On a finitary version of mathematical analysis. 261-295 - Zhaohui Luo:
Coercion completion and conservativity in coercive subtyping. 297-322 - Michael A. Taitslin:
A general condition for collapse results. 323-330 - Maxim Vsemirnov:
The Woods-Erdös conjecture for polynomial rings. 331-344 - Tatiana Yavorskaya:
Logic of proofs and provability. 345-372 - Rostislav E. Yavorsky:
Provability logics with quantifiers on proofs. 373-387 - I. D. Zaslavsky:
Dual realizability in symmetric logic. 389-397
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-11 02:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
