28 found
Order:
  1.  16
    Stephen L. Bloom (1975). Some Theorems on Structural Consequence Operations. Studia Logica 34 (1):1 - 9.
    Two characterizations are given of those structural consequence operations on a propositional language which can be defined via proofs from a finite number of polynomial rules.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   18 citations  
  2.  8
    Roman Suszko & Stephen L. Bloom (1972). Investigations Into the Sentential Calculus with Identity. Notre Dame Journal of Formal Logic 13 (3):289-308.
  3.  4
    Stephen L. Bloom (1971). Some Remarks on Uniform Halting Problems. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):281-284.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4.  32
    Roman Suszko & Stephen L. Bloom (1972). Investigations Into the Sentential Calculus with Identity. Notre Dame Journal of Formal Logic 13 (3):289-308.
  5.  12
    Stephen L. Bloom & Roman Suszko (1975). Ultraproducts of SCI Models. Bulletin of the Section of Logic 4 (1):9-12.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  6.  31
    Stephen L. Bloom & Roman Suszko (1971). Semantics for the Sentential Calculus with Identity. Studia Logica 28 (1):77 - 82.
  7.  6
    Stephen L. Bloom (1990). Review: Ryszard Wojcicki, Theory of Logical Calculi. Basis Theory of Consequence Operations. [REVIEW] Journal of Symbolic Logic 55 (3):1324-1326.
  8.  12
    Stephen L. Bloom (1976). Projective and Inductive Generation of Abstract Logics. Studia Logica 35 (3):249 - 255.
    An abstract logic A, C consists of a finitary algebraA and a closure systemC onA. C induces two other closure systems onA, C P andC I, by projective and inductive generation respectively. The various relations amongC, C P andC I are determined. The special case thatC is the standard equational closure system on monadic terms is studied in detail. The behavior of Boolean logics with respect to projective and inductive generation is determined.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  9.  9
    Stephen L. Bloom (1982). A Note on the Logic of Signed Equations. Studia Logica 41 (1):75 - 81.
    A signed -equation is an expression of the form t t or t t, where t and t are -terms (for some ranked set ). We characterize those classes of -algebras which are models of a set of signed -equations. Further we consider the problem of finding a complete deductive system analogous to equational logic for the logical consequence operation restricted to signed equations.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  10.  8
    Stephen L. Bloom (1975). A Representation Theorem for the Lattice of Standard Consequence Operations. Studia Logica 34 (3):235 - 237.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  11.  14
    Stephen L. Bloom & Roman Suszko (1971). Semantyka Dla Rachunku Zdań Z Identycznością. Studia Logica 28 (1):82-82.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12.  18
    Stephen L. Bloom (1971). A Completeness Theorem for “Theories of Kind W”. Studia Logica 27 (1):43 - 56.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  13.  18
    Stephen L. Bloom (1973). Extensions of Gödel's Completeness Theorem and the Löwenheim-Skolem Theorem. Notre Dame Journal of Formal Logic 14 (3):408-410.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  14.  3
    Roman Suszko & Stephen L. Bloom (1971). Semantics for the Sentential Calculus with Identity. Studia Logica 28 (1):77-82.
  15.  10
    Stephen L. Bloom (1974). On “Generalized Logics”. Studia Logica 33 (1):65 - 68.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  16. Stephen L. Bloom (1971). A Completeness Theorem for “Theories of Kind W”. Studia Logica 27 (1):43-55.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  17. Stephen L. Bloom (1970). The Hyperprojective Hierarchy. Mathematical Logic Quarterly 16 (2):149-164.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  18.  3
    Stephen L. Bloom & Roman Suszko (1976). Errata: Investigations Into the Sentential Calculus with Identity. Notre Dame Journal of Formal Logic 17 (4):640-640.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  19.  5
    Stephen L. Bloom (1984). Roman Suszko: A Reminiscence. Studia Logica 43 (4):313 -.
  20.  2
    Stephen L. Bloom (1991). Büchi J. Richard. Finite Automata, Their Algebras and Grammars. Towards a Theory of Formal Expressions. Edited by Siefkes Dirk. Springer-Verlag, New York, Berlin, Heidelberg, Etc., 1989, Xii+ 316 Pp. [REVIEW] Journal of Symbolic Logic 56 (2):762-763.
    Direct download  
     
    Export citation  
     
    My bibliography  
  21.  2
    Stephen L. Bloom (1968). A Note on the Arithmetical Hierarchy. Notre Dame Journal of Formal Logic 9 (1):89-91.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  22.  1
    Stephen L. Bloom (1990). Wójcicki Ryszard. Theory of Logical Calculi. Basis Theory of Consequence Operations. Synthese Library, Vol. 199. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1988, Xviii+ 473 Pp. [REVIEW] Journal of Symbolic Logic 55 (3):1324-1326.
    Direct download  
     
    Export citation  
     
    My bibliography  
  23.  1
    Stephen L. Bloom (1991). Review: J. Richard Buchi, Dirk Siefkes, Finite Automata, Their Algebras and Grammars. Towards a Theory of Formal Expressions. [REVIEW] Journal of Symbolic Logic 56 (2):762-763.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  24.  1
    Stephen L. Bloom (1969). A Semi-Completeness Theorem. Notre Dame Journal of Formal Logic 10 (3):303-308.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25. Stephen L. Bloom (1975). A Note on the Predicatively Definable Sets of N. N. Nepeîvoda. Mathematical Logic Quarterly 21 (1):427-431.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  26. Stephen L. Bloom (1974). On “Generalized Logics”. Studia Logica 33 (1):65-68.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27. Stephen L. Bloom (1997). Review: Norman M. Martin, Stephen Pollard, Closure Spaces and Logic. [REVIEW] Journal of Symbolic Logic 62 (2):685-686.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  28. Stephen L. Bloom (1971). Some Remarks on Uniform Halting Problems. Mathematical Logic Quarterly 17 (1):281-284.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography