default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStudia Logica, Volume 47
Volume 47, Number 1, March 1988
- Francesco Caro:
Graded modalities, II (canonical models). 1-10 - Francesco Caro:
Normal predicative logics with graded modalities. 11-22 - Wojciech Buszkowski
:
Gaifman's theorem on categorial grammars revisited. 23-33 - Michael Böttner:
A note on existential import. 35-40 - Tsutomu Hosoi:
Gentzen-type formulation of the prepositional logic LQ. 41-48 - Roman Tuziak:
An axiomatization of the finite-valued Łukasiewicz calculus. 49-55 - Adam Gajda:
The adequacy condition as a definition of elementary interpretation. 57-69 - Janusz Czelakowski:
Books received. 71-77
Volume 47, Number 2, June 1988
- Melvin Fitting:
Pseudo-Boolean valued prolog. 85-91 - Marek Tokarz:
Synonymy in sentential languages: a pragmatic view. 93-97 - Maurizio Fattorosi-Barnaba, Claudio Cerrato:
Graded modalities. III (the completeness and compactness of S40). 99-110 - Ross T. Brady:
A content semantics for quantified relevant logics. I. 111-127 - Martin W. Bunder:
Arithmetic based on the Church numerals in illative combinatory logic. 129-143 - M. J. Cresswell:
Necessity and contingency. 145-149 - Branislav R. Boricic:
A note on sequent calculi intermediate between LJ and LK. 151-157 - José M. Méndez:
Converse Ackermann Croperty and semiclassical negation. 159-168 - Janusz Czelakowski:
Books received. 169-176
Volume 47, Number 3, September 1988
- Michael M. Richter, Manfred E. Szabo:
Nonstandard methods in combinatorics and theoretical computer science. 181-191 - László Csirmaz:
Stability of weak second-order semantics. 193-202 - E. J. Farkas:
A faithful embedding of parallel computations in star-finite models. 203-212 - Michal Grabowski:
Arithmetical completeness versus relative completeness. 213-220 - Joram Hirshfeld:
Nonstandard combinatorics. 221-232 - Dexter Kozen:
A finite model theorem for the propositional μ-calculus. 233-241 - Steven C. Leth:
Sequences in countable nonstandard models of the natural numbers. 243-263 - Steven C. Leth:
Some nonstandard methods in combinatorial number theory. 265-278 - Ildikó Sain:
Is "some-other-time" sometimes better than "sometime" for proving partial correctness of programs? 279-301 - Frank Wattenberg:
Nonstandard analysis and constructivism? 303-309
Volume 47, Number 4, December 1988
- Dev Kumar Roy, Richard Watnick:
Finite condensations of recursive linear orders. 311-317 - Herman Dishkant:
Mathematics of Totalities: an alternative to mathematics of sets. 319-326 - George Weaver:
Classifying ℵ0-categorical theories. 327-345 - Krister Segerberg:
Talking about actions. 347-352 - Kosta Dosen:
Sequent-systems and groupoid models. I. 353-385 - Renato A. Lewin:
Involutions defined by monadic terms. 387-389 - Hiroakira Ono:
On finite linear intermediate predicate logics. 391-399 - Renato H. L. Pedrosa, Antonio M. A. Sette:
A representation theorem for languages with generalized quantifiers through back-and-forth methods. 401-411 - Richard Sylvan, Newton Costa:
Cause as an implication. 413-428 - Michal Krynicki:
The non-definability notion and first order logic. 429-437 - Janusz Czelakowski:
Books received. 439-441
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-12-04 22:09 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:
