Towards an abstract theory of Lindenbaum operators. Abstract

Bulletin of Symbolic Logic 2 (1):119-120 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

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

On closure operators one-to-one associated with fixed object languages. Abstract.S. J. Surma - 1995 - Bulletin of Symbolic Logic 1 (3):358.
Reviewed Work(s): Finite and algorithmic model theory by Javier Esparza; Christian Michaux; Charles Steinhorn.Michael Benedikt - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Neighborhood semantics for intentional operators.Graham Priest - 2009 - Review of Symbolic Logic 2 (2):360-373.
Reviewed Work(s): Some theorems on the algorithmic approach to probability theory and information theory (1971 Dissertation directed by A. N. Kolmogorov). Annals of Pure and Applied Logic, vol. 162 by L. A. Levin. [REVIEW]Jan Reimann - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Hosiasson Janina Lindenbaum. Induction et analogie: Comparaison de leur fondement. Mind, n. s. vol. 50 , pp. 351–365.Cabl G. Hempel - 1942 - Journal of Symbolic Logic 7 (1):40-41.
John R. Steel and W. Hugh Woodin, HOD as a core model, Ordinal Definability and Recursion Theory: The Cabal Seminar, vol. III (A. S. Kechris, B. Löwe, and J. R. Steel, editors), Lecture Notes in Logic 43, Association for Symbolic Logic and Cambridge University Press, 2016, pp. 257–343. [REVIEW]Ernest Schimmerling - 2016 - Bulletin of Symbolic Logic 22 (4):521-524.
Towards algebraic graph-based model theory for computer science.Z. Diskin - 1997 - Bulletin of Symbolic Logic 3:144-145.
Review: J. P. Mayberry, The Foundations of Mathematics in the Theory of Sets. [REVIEW]W. Tai - 2002 - Bulletin of Symbolic Logic 8 (3):424-426.
Reviewed Work(s): An introduction to the philosophy of mathematics by Mark Colyvan.Richard Pettigrew - 2013 - Association for Symbolic Logic: The Bulletin of Symbolic Logic 19 (3):396-397.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.

Analytics

Added to PP
2014-01-21

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

Add more citations

References found in this work

No references found.

Add more references