Caracterización en lenguajes lógicos infinitarios de los órdenes parciales diseminados contables

Theoria 9 (1):173-184 (1994)
Taking into account that no subordering of a scattered partial ordering is dense, we are going to define one idea of rank of a partial ordering which will make possible an equivalent but more operative definition of a scattered partial ordering. Using this notion of rank and the Scott’s sentence associated with the ordering, we are going to characterise in the infinitary language Lw1.w each element of a subclass of the partial orderings, this of the strongly scattered countable partial orderings
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI theoria19949141
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,651
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.

Monthly downloads

Added to index


Total downloads

53 ( #90,882 of 1,902,709 )

Recent downloads (6 months)

13 ( #66,247 of 1,902,709 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.