Sommaire

There are denumerably many ternary intuitionistic Sheffer functions.

Čubrić, Djordje

Text on Project Euclid
PDF
Alt PDF
p. 579-581

Project Euclid
Definability in self-referential systems.

Zimbarg Sobrinho, J.

Text on Project Euclid
PDF
Alt PDF
p. 574-578

Project Euclid
Equivalent versions of a weak form of the axiom of choice.

Shannon, Gary P.

Text on Project Euclid
PDF
Alt PDF
p. 569-573

Project Euclid
On certain normalizable natural deduction formulations of some propositional intermediate logics.

Boričić, Branislav R.

Text on Project Euclid
PDF
Alt PDF
p. 563-568

Project Euclid
On begging the question ``Who is $N$?''.

Patton, Thomas E.

Text on Project Euclid
PDF
Alt PDF
p. 553-562

Project Euclid
A basic free logic.

Wu, Kathleen Johnson

Text on Project Euclid
PDF
Alt PDF
p. 543-552

Project Euclid
Many-sorted elementary equivalence.

Dzierzgowski, Daniel

Text on Project Euclid
PDF
Alt PDF
p. 530-542

Project Euclid
On the logic of contingent relevant implication: a conceptual incoherence in the intuitive interpretation of ${\rm R}$.

Lance, Mark

Text on Project Euclid
PDF
Alt PDF
p. 520-529

Project Euclid
Material implication and entailment.

Ceniza, Claro R.

Text on Project Euclid
PDF
Alt PDF
p. 510-519

Project Euclid
On the existence of polynomial time algorithms for interpolation problems in propositional logic.

Dahlhaus, E. ; Israeli, A. ; Makowsky, J. A.

Text on Project Euclid
PDF
Alt PDF
p. 497-509

Project Euclid
On the methodology of possible worlds semantics. I. Correspondence theory.

Pearce, David ; Wansing, Heinrich

Text on Project Euclid
PDF
Alt PDF
p. 482-496

Project Euclid
First-order logics for comparative similarity.

Williamson, Timothy

Text on Project Euclid
PDF
Alt PDF
p. 457-481

Project Euclid
An ``almost classical'' period-based tense logic.

White, Michael J.

Text on Project Euclid
PDF
Alt PDF
p. 438-453

Project Euclid
Infima of recursively enumerable truth table degrees.

Fejer, Peter A. ; Shore, Richard A.

Text on Project Euclid
PDF
Alt PDF
p. 420-437

Project Euclid
A unified approach to relative interpolation.

Duchhart, Dennis

Text on Project Euclid
PDF
Alt PDF
p. 412-419

Project Euclid
Simplicity.

Pambuccian, Victor

Text on Project Euclid
PDF
Alt PDF
p. 396-411

Project Euclid
Preliminary notes on a new modal syllogistic.

Englebretsen, George

Text on Project Euclid
PDF
Alt PDF
p. 381-395

Project Euclid
On the logic of continuous algebras.

Adámek, Jiří ; Mekler, Alan H. ; Nelson, Evelyn ; Reiterman, Jan

Text on Project Euclid
PDF
Alt PDF
p. 365-380

Project Euclid
Topological duality for diagonalizable algebras.

Bernardi, Claudio ; D'Aquino, Paola

Text on Project Euclid
PDF
Alt PDF
p. 345-364

Project Euclid
Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem.

Sain, Ildikó

Text on Project Euclid
PDF
Alt PDF
p. 332-344

Project Euclid
Nonstandard connectives of intuitionistic propositional logic.

Kaminski, Michael

Text on Project Euclid
PDF
Alt PDF
p. 309-331

Project Euclid
Pointwise definable substructures of models of Peano arithmetic.

Murawski, Roman

Text on Project Euclid
PDF
Alt PDF
p. 295-308

Project Euclid
Semantical analysis of superrelevant predicate logics with quantification.

Szatkowski, Mirosław

Text on Project Euclid
PDF
Alt PDF
p. 281-294

Project Euclid
Precisification by means of vague predicates.

Sorensen, Roy A.

Text on Project Euclid
PDF
Alt PDF
p. 267-275

Project Euclid
Mindful logic: how to resolve some paradoxes of identity.

Pannier, Russell ; Sullivan, Thomas

Text on Project Euclid
PDF
Alt PDF
p. 249-266

Project Euclid
On proving functional incompleteness in symbolic logic classes.

Pelletier, Francis Jeffry ; Sharp, W. David

Text on Project Euclid
PDF
Alt PDF
p. 235-248

Project Euclid
Approximate truth and Ł ukasiewicz logic.

Weston, T. S.

Text on Project Euclid
PDF
Alt PDF
p. 229-234

Project Euclid
Epistemic set theory.

Reinhardt, William N.

Text on Project Euclid
PDF
Alt PDF
p. 216-228

Project Euclid
Alphabetical order.

Boolos, George

Text on Project Euclid
PDF
Alt PDF
p. 214-215

Project Euclid
The Lindenbaum construction and decidability.

Shapiro, Stewart

Text on Project Euclid
PDF
Alt PDF
p. 208-213

Project Euclid
A note on arbitrarily complex recursive functions.

Smith, Carl H.

Text on Project Euclid
PDF
Alt PDF
p. 198-207

Project Euclid
Generalized Hardy fields in several variables.

Pasini, Leonardo

Text on Project Euclid
PDF
Alt PDF
p. 193-197

Project Euclid
Partially generic formulas in arithmetic.

Lindström, Per

Text on Project Euclid
PDF
Alt PDF
p. 185-192

Project Euclid