Review: M. I. Kratko, Formal Post Calculi and Finite Automata [Book Review]

Journal of Symbolic Logic 32 (3):393-393 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: M. I. Kratko, E. Mendelson, A Class of Post Calculi. [REVIEW]J. W. Thatcher - 1967 - Journal of Symbolic Logic 32 (3):393-393.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Review: M. P. Schutzenberger, On the Definition of a Family of Automata; M. P. Schutzenberger, Finite Counting Automata; M. P. Schutzenberger, Certain Elementary Families of Automata. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
Review: C. Y. Lee, Automata and Finite Automata. [REVIEW]J. C. Shepherdson - 1971 - Journal of Symbolic Logic 36 (3):534-535.
Finite State Automata and Monadic Definability of Singular Cardinals.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):412 - 438.
Review: J. Richard Buchi, Dirk Siefkes, Finite Automata, their Algebras and Grammars. Towards a Theory of Formal Expressions. [REVIEW]Stephen L. Bloom - 1991 - Journal of Symbolic Logic 56 (2):762-763.
Behaviorism, finite automata, and stimulus response theory.Raymond J. Nelson - 1975 - Theory and Decision 6 (August):249-67.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Modifiable automata self-modifying automata.J.-P. Moulin - 1992 - Acta Biotheoretica 40 (2-3):195-204.
Some results concerning finite models for sentential calculi.Dolph Ulrich - 1972 - Notre Dame Journal of Formal Logic 13 (3):363-368.
Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
Finite model property for five modal calculi in the neighbourhood of $S3$.Anjan Shukla - 1971 - Notre Dame Journal of Formal Logic 12 (1):69-74.
Erratum: ``Some results concerning finite models for sentential calculi''.Dolph Ulrich - 1974 - Notre Dame Journal of Formal Logic 15 (4):648-648.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Degrees of maximality of Łukasiewicz-like sentential calculi.Grzegorz Malinowski - 1977 - Studia Logica 36 (3):213 - 228.

Analytics

Added to PP
2013-11-22

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references