|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
24 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A first order logic for specification of timed algorithms: basic properties and a decidable class |
Beauquier, Danièle |
2001 |
113 | 1-3 |
p. 13-52 40 p. |
artikel |
|
| 2 | A general condition for collapse results |
Taitslin, Michael A. |
2001 |
113 | 1-3 |
p. 323-330 8 p. |
artikel |
|
| 3 | A(nother) characterization of intuitionistic propositional logic |
Iemhoff, Rosalie |
2001 |
113 | 1-3 |
p. 161-173 13 p. |
artikel |
|
| 4 | Arithmetic complexity of the predicate logics of certain complete arithmetic theories |
Plisko, Valery |
2001 |
113 | 1-3 |
p. 243-259 17 p. |
artikel |
|
| 5 | Author index |
2001 |
113 | 1-3 |
p. 399-400 2 p. |
artikel |
||
| 6 | Coercion completion and conservativity in coercive subtyping |
Soloviev, Sergei |
2001 |
113 | 1-3 |
p. 297-322 26 p. |
artikel |
|
| 7 | Complexity of Null- and Positivstellensatz proofs |
Grigoriev, Dima |
2001 |
113 | 1-3 |
p. 153-160 8 p. |
artikel |
|
| 8 | Complexity of t-tautologies |
Baaz, Matthias |
2001 |
113 | 1-3 |
p. 3-11 9 p. |
artikel |
|
| 9 | Computational complexity of quantifier-free negationless theory of field of rational numbers |
Kossovski, Nikolai |
2001 |
113 | 1-3 |
p. 175-180 6 p. |
artikel |
|
| 10 | Contents |
2001 |
113 | 1-3 |
p. v-vi nvt p. |
artikel |
||
| 11 | Dual realizability in symmetric logic |
Zaslavsky, I.D. |
2001 |
113 | 1-3 |
p. 389-397 9 p. |
artikel |
|
| 12 | Finite methods in 1-order formalisms |
Gordeev, L. |
2001 |
113 | 1-3 |
p. 121-151 31 p. |
artikel |
|
| 13 | Interpolation theorems for intuitionistic predicate logic |
Mints, G. |
2001 |
113 | 1-3 |
p. 225-242 18 p. |
artikel |
|
| 14 | Logic of proofs and provability |
Yavorskaya (Sidon), Tatiana |
2001 |
113 | 1-3 |
p. 345-372 28 p. |
artikel |
|
| 15 | MAX SAT approximation beyond the limits of polynomial-time approximation |
Dantsin, Evgeny |
2001 |
113 | 1-3 |
p. 81-94 14 p. |
artikel |
|
| 16 | On a finitary version of mathematical analysis |
Shanin, N.A. |
2001 |
113 | 1-3 |
p. 261-295 35 p. |
artikel |
|
| 17 | On calculational proofs |
Lifschitz, Vladimir |
2001 |
113 | 1-3 |
p. 207-224 18 p. |
artikel |
|
| 18 | Preface |
Matiyasevich, Yuri |
2001 |
113 | 1-3 |
p. 1- 1 p. |
artikel |
|
| 19 | Provability logics with quantifiers on proofs |
Yavorsky, Rostislav E. |
2001 |
113 | 1-3 |
p. 373-387 15 p. |
artikel |
|
| 20 | The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete |
Beltiukov, Anatoly P. |
2001 |
113 | 1-3 |
p. 53-58 6 p. |
artikel |
|
| 21 | The single-conclusion proof logic and inference rules specification |
Krupski, Vladimir N. |
2001 |
113 | 1-3 |
p. 181-206 26 p. |
artikel |
|
| 22 | The Woods–Erdös conjecture for polynomial rings |
Vsemirnov, Maxim |
2001 |
113 | 1-3 |
p. 331-344 14 p. |
artikel |
|
| 23 | Towards logical operations research—propositional case |
Davydov, Gennady |
2001 |
113 | 1-3 |
p. 95-119 25 p. |
artikel |
|
| 24 | Window-accumulated subsequence matching problem is linear |
Boasson, Luc |
2001 |
113 | 1-3 |
p. 59-80 22 p. |
artikel |
24 gevonden resultaten