default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 29
Volume 29, Number 1, 1983
- Erik Ellentuck:
Random Isols. 1-6 - Robin J. Grayson:
On Closed Subsets of the Intuitionistic Reals. 7-9 - Gérard Lopez:
Reconstruction d'une S-Expansion. 11-24 - Silvio Valentini:
The Modal Logic of Consistency Assertions of Peano Arithmetic. 25-32
Volume 29, Number 2, 1983
- Luisa Iturrioz:
Symmetrical Heyting Algebras with Operators. 33-70 - John L. Hickman:
An Ordinal Version of the Fundamental Law of Algebra. 71-74 - Karel Hrbacek:
Degrees of analytic Sets. 75-82 - Klaus Benecke:
Spezifikation parametrisierter Datentypen. 83-96
Volume 29, Number 3, 1983
- Williams Kramer Forrest:
The Theory of Affine Constructible Sets. 97-135 - Michel Parigot:
Le modèle Compagnon de la THéOrie des arbres. 137-150 - Zarko Mijajlovic, Valentina S. Harizanov:
Regular Relations and the Quantifier "There Exist uncountably Many". 151-161 - Franco Montagna:
Zfc-Models as Kripke-Models. 163-168 - Hans Kleine Büning:
Durch syntaktische Rekursion definierte Klassen. 169-175
Volume 29, Number 4, 1983
- Dag Normann:
General Type-Structures of Continuous and Countable Functionals. 177-192 - Alan Adamson:
A Note on Two-Cardinal Models. 193-196 - William S. Hatcher, Claude Laflamme:
On the Order Structure of the Hyperreal Line. 197-202 - F. W. Gorgy, A. H. Sahyoun:
Transformability of the Formulas of the Languages of Markov ln, Lω Int Formulas of the Language &equation Image;2. 203-206 - Ford W. Gorgy, A. H. Sahyoun:
Mutual Transformability of Formulas of the Languages of Markov Lωn and &equation Image;n1. 207-212 - Jürgen Hauck:
Konstruktive reelle funktionale und Operatoren. 213-218 - Manfred E. Szabo:
The Continuous Realizability of Entailment. 219-233 - Marcel Crabbé:
On the Reduction of Type Theory. 235-237 - Albert Hoogewijs:
A Partial Predicate Calculus in a Two-Valued Logic. 239-243 - C. Alkor, Benedetto Intrigila:
Baire Category on Cardinals. 245-252 - Michael von Rimscha:
Hierarchies for Non-Founded Models of Set Theory. 253-288
Volume 29, Number 5, 1983
- J. Richard Büchi, Dirk Siefkes:
The Complete Extensions of the Monadic Second Order Theory of Countable Ordinals. 289-312 - J. Richard Büchi, Charles Zaiontz:
Deterministic Automata and the Monadic Theory of Ordinals < ω2. 313-336
Volume 29, Number 6, 1983
- Charles Zaiontz:
Axiomatization of the Monadic Theory of Ordinals < ω2. 337-356 - Karl-Heinz Diener:
On Constructing Infinitary Languages Lα β without the Axiom of Choice. 357-376 - John Jones:
A Formalisation of an M-Valued Propositional Calculus with Variable Functors. 377-378 - Rod Downey:
On a Question of a. Retzlaff. 379-384
Volume 29, Number 8, 1983
- Thomas Becker:
Real Closed Rings and Ordered Valuation Ring. 417-425 - Dietmar Schweigert, Magdalena Szymanska:
A Completeness Theorem for Correlation Lattices. 427-434 - Norbert Brunner
:
KategoriesäTze und multiples Auswahlaxiom. 435-443 - Philipp Rothmaler:
Stationary Types in Moduless. 445-464
Volume 29, Number 9, 1983
- Bernd I. Dahn, Helmut Wolter:
On the Theory of exponential Fields. 465-480
Volume 29, Number 10, 1983
- Alan Rose:
Scompleteness of Sets of Three-Valued Sheffer Function. 481-483 - Edward R. Griffor:
Some Consequences of Ad for Kleene Recursion in 3E. 485-492 - Joachim Lambek, Philip J. Scott:
New Proofs of Some Intuitionistic Principles. 493-504 - Robert A. G. Seely:
Hyperdoctrines, Natural Deduction and the Beck Condition. 505-542 - John Jones:
Implication and Iterated Implication. 543-556
Volume 29, Number 11, 1983
- Krister Segerberg:
Arbitrary Truth-Value Functions and Natural Deduction. 557-564 - Martin Kühnrich:
Eine äQuivalente Formalisierung der Logik von Feferman und Aczel. 565-568 - Manfred Armbrust:
Equivalence Relations versus Unary Operations. 569-571
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-01-09 19:37 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:
