Equalization of finite flowers

Journal of Symbolic Logic 53 (1):105-123 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

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

Finite variable logic, stability and finite models.Marko Djordjevic - 2001 - Journal of Symbolic Logic 66 (2):837-858.
Delayed-Logic and Finite-State Machines.Dean N. Arden - 1971 - Journal of Symbolic Logic 36 (1):151-151.
Finite nest structures and propositional logic.Raymond M. Smullyan - 1966 - Journal of Symbolic Logic 31 (3):322-324.
Finite Problems.Elliott Medelson & Sue Ann Walker - 1973 - Journal of Symbolic Logic 38 (2):330-331.
Non-finite-axiomatizability results in algebraic logic.Balázs Biró - 1992 - Journal of Symbolic Logic 57 (3):832 - 843.
A finite arithmetic.Philip T. Shepard - 1973 - Journal of Symbolic Logic 38 (2):232-248.
On Finite Logics.C. G. Mckay - 1971 - Journal of Symbolic Logic 36 (2):330-330.

Analytics

Added to PP
2009-01-28

Downloads
56 (#383,100)

6 months
20 (#145,085)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stefano Berardi
Università degli Studi di Torino

Citations of this work

No citations found.

Add more citations

References found in this work

Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75-219.
Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.

Add more references