On Binary Computation Structures

Mathematical Logic Quarterly 43 (2):203-215 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Expressive completeness of modal logic on binary ramified frames.Bernhard Heinemann - 1996 - Journal of Applied Non-Classical Logics 6 (4):347-367.
Ordinal preference representations.Niall M. Fraser - 1994 - Theory and Decision 36 (1):45-67.
Finding paths through narrow and wide trees.Stephen Binns & Bjørn Kjos-Hanssen - 2009 - Journal of Symbolic Logic 74 (1):349-360.
Reasoning, logic and computation.Stewart Shapiro - 1995 - Philosophia Mathematica 3 (1):31-51.
Decidable and undecidable logics with a binary modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.
Quantifiers determined by classes of binary relations.Michał Krynicki - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 125--138.
Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.

Analytics

Added to PP
2013-12-01

Downloads
6 (#1,463,802)

6 months
1 (#1,475,085)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Logics of Time and Computation.Robert Goldblatt - 1990 - Studia Logica 49 (2):284-286.

Add more references