- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On an algebra of sets of finite sequences
Journal of Symbolic Logic 35 (1):19-28 (1970)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On Endomorphisms of Ockham Algebras with Pseudocomplementation.T. S. Blyth & J. Fang - 2011 - Studia Logica 98 (1-2):237-250.
Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
A new symbolic representation for the algebra of sets.Jerome Frazee - 1990 - History and Philosophy of Logic 11 (1):67-75.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.
A mathematical characterization of the physical structure of observers.Matthew J. Donald - 1995 - Foundations of Physics 25 (4):529-571.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Analytics
Added to PP
2009-01-28
Downloads
60 (#253,024)
6 months
2 (#1,015,942)
2009-01-28
Downloads
60 (#253,024)
6 months
2 (#1,015,942)
Historical graph of downloads
Citations of this work
Complexity of equations valid in algebras of relations part I: Strong non-finitizability.Hajnal Andréka - 1997 - Annals of Pure and Applied Logic 89 (2):149-209.
Complexity of equational theory of relational algebras with projection elements.Szabolcs Mikulás, Ildikó Sain & Andras Simon - 1992 - Bulletin of the Section of Logic 21 (3):103-111.
An autobiography of polyadic algebras.Paul R. Halmos - 2000 - Logic Journal of the IGPL 8 (4):383-392.
Algebraic Logic, Where Does It Stand Today?Tarek Sayed Ahmed - 2005 - Bulletin of Symbolic Logic 11 (3):465-516.
Complexity of equational theory of relational algebras with standard projection elements.Szabolcs Mikulás, Ildikó Sain & András Simon - 2015 - Synthese 192 (7):2159-2182.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-67rzb uwo