Switch to: References

Citations of:

[Omnibus Review]

Journal of Symbolic Logic 32 (2):280-281 (1967)

Add citations

You must login to add citations.

Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.details Extended algorithmic logic (EAL) as introduced in [18] is a modified version of extended +-valued algorithmic logic. Only two-valued predicates and two-valued propositional variables occur in EAL. The role of the +-valued logic is restricted to construct control systems (stacks) of pushdown algorithms whereas their actions are described by means of the two-valued logic. Thus EAL formalizes a programming theory with recursive procedures but without the instruction CASE.The aim of this paper is to discuss EAL and prove the completeness theorem. (...) Download Export citation Bookmark 1 citation
Analytic combinatory calculi and the elimination of transitivity.Pierluigi Minari - 2004 - Archive for Mathematical Logic 43 (2):159-191.details We introduce, in a general setting, an ‘‘analytic’’ version of standard equational calculi of combinatory logic. Analyticity lies on the one side in the fact that these calculi are characterized by the presence of combinatory introduction rules in place of combinatory axioms, and on the other side in that the transitivity rule proves to be eliminable. Apart from consistency, which follows immediately, we discuss other almost direct consequences of analyticity and the main transitivity elimination theorem; in particular the Church−Rosser and (...) Download Export citation Bookmark 2 citations
Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem.R. E. Hodel - 2005 - Archive for Mathematical Logic 44 (4):459-472.details We formulate a restricted version of the Tukey-Teichmüller Theorem that we denote by (rTT). We then prove that (rTT) and (BPI) are equivalent in ZF and that (rTT) applies rather naturally to several equivalent forms of (BPI): Alexander Subbase Theorem, Stone Representation Theorem, Model Existence and Compactness Theorems for propositional and first-order logic. We also give two variations of (rTT) that we denote by (rTT)+ and (rTT)++; each is equivalent to (rTT) in ZF. The variation (rTT)++ applies rather naturally to (...) Download Export citation Bookmark 2 citations

1