default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 43
Volume 43, 1997
- Iain A. Stewart:
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second-Order Logic. 1-21 - Ralf-Dieter Schindler:
Weak Covering at Large Cardinals. 22-28 - Stefano Mazzanti:
Iterative Characterizations of Computable Unary Functions: A General Method. 29-38 - Martin Goldstern
:
Strongly Amorphous Sets and Dual Dedekind Infinity. 39-44 - Takeshi Yamaguchi:
Effective Nonrecursiveness. 45-48 - Edward Hermann Haeusler, Marcelo da Silva Corrêa:
A Concrete Categorical Model for the Lambek Syntactic Calculus. 49-59 - Miroslawa Kolowska-Gawiejnowicz:
Powerset Residuated Algebras and Generalized Lambek Calculus. 60-72 - Jean Sylvestre Gakwaya:
Characterization of the Relations in Grzegorczyk's Hierarchy Revisited. 73-77 - Çigdem Gencer, Mehmet Terziler:
On a Question of Phillips. 78-82 - Joseph Barback:
On Regressive Isols and Comparability of Summands and a Theorem of R. Downey. 83-91 - Fabio Bellissima, Saverio Cittadini:
Minimal Axiomatization in Modal Logic. 92-102 - Masahiro Hamano, Mitsuhiro Okada:
A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. 103-120 - James P. Jones, Hilbert Levitz, Warren D. Nichols:
On Series of Ordinals and Combinatorics. 121-133 - Tapani Hyttinen:
On Nonstructure of Elementary Submodels of an Unsuperstable Homogeneous Structure. 134-142 - Felipe Cucker:
Machines Over the Reals and Non Uniformity. 143-157 - Iain A. Stewart:
Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic. 158-178 - Marco Cesati, Miriam Di Ianni:
Computation Models for Parameterized Complexity. 179-202 - Bernhard Heinemann:
On Binary Computation Structures. 203-215 - Vasco Brattka:
Order-free Recursion on the Real Numbers. 216-234 - Alexandra A. Soskova:
Effective Structures. 235-250 - Klaus Hilmar Sprenger:
Some Hierarchies of Primitive Recursive Functions on Term Algebras. 251-286 - Kate Copestake:
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds. 287-310 - Rodney G. Downey:
On the Universal Splitting Property. 311-320 - Erik Palmgren:
Constructive Sheaf Semantics. 321-327 - Takeshi Yamaguchi, Ryo Kashima:
On the Difficulty of Writing Out Formal Proofs in Arithmetic. 328-332 - Aviad Heifetz:
Infinitary S5-Epistemic Logic. 333-342 - Miklós Erdélyi-Szabó:
Decidability in the Constructive Theory of Reals as an Ordered ℚ-vectorspace. 343-354 - Jun Li:
On Remainder Equations. 355-368 - Olivier Esser:
An Interpretation of the Zermelo-Fraenkel Set Theory and the Kelley-Morse Set Theory in a Positive Theory. 369-377 - Hisato Muraki:
Non Complementedness and Non Distributivity of Kleene Degrees. 378-388 - Vladimir Kanovei, Michiel van Lambalgen:
On a Spector Ultrapower for the Solovay Model. 389-395 - Kazuyuki Tanaka:
Non standard Analysis in WKL0. 396-400 - Domenico Zambella:
Forcing in Finite Structures. 401-412 - Thierry Lacoste:
A Simplified Proof of the 0-1 Law for Existential Second-Order Ackermann Sentences. 413-418 - Malika More, Frédéric Olive:
Rudimentary Languages and Second Order Logic. 419-426 - Arthur W. Apter:
More on the Least Strongly Compact Cardinal. 427-430 - Ronald Fagin:
Comparing the Power of Games on Graphs. 431-455 - Dugald Macpherson, Charles Steinhorn:
Extending Partial Orders on o-Minimal Structures to Definable Total Orders. 456-464 - Roland Hinnion:
Directed Sets and Malitz-Cauchy-Completions. 465-484 - Eiko Isoda, Kazuaki Nagaoka:
Incompleteness Results in Kripke Bundle Semantics. 485-498 - Marian Boykan Pour-El, Ning Zhong:
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable. 499-509 - Birger Strauch:
On Partial Classes Containing All Monotone and Zero-Preserving Total Boolean Functions. 510-524 - Nicholas Bamber, Henryk Kotlarski:
On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic. 525-540 - Yoshihiro Abe:
Combinatorics for Small Ideals on Pkλ. 541-549 - Branislav R. Boricic:
Validity Measurement in Some Propositional Logics. 550-558 - Phil Watson:
Embeddings in the Strong Reducibilities Between 1 and npm. 559-568 - Carl G. Jockusch Jr., Frank Stephan:
Correction to "A Cohesive Set which is not High". 569
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 2024-12-31 21:34 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:
