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

Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 9 (1):173-184 (1994)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
79 (#262,129)

6 months
8 (#551,658)

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

No references found.

Add more references