A Note on Absolutely Unorderable Combinatory Algebras.
Saved in:
| Title: | A Note on Absolutely Unorderable Combinatory Algebras. |
|---|---|
| Authors: | Lusin, Stefania1 slusin@dsi.unive.it, Salibra, Antonino1 salibra@dsi.unive.it |
| Source: | Journal of Logic & Computation. Aug2003, Vol. 13 Issue 4, p481-502. 22p. |
| Subjects: | Combinatory logic, Algebra, Axioms, Lambda calculus, Function algebras, Mathematical analysis |
| Abstract: | Plotkin has conjectured that there exists an absolutely unorderable combinatory algebra, namely a combinatory algebra which cannot be embedded in another combinatory algebra admitting a nontrivial compatible partial order. In this paper we prove that a wide class of combinatory algebras admits extensions with a nontrivial compatible partial order. [ABSTRACT FROM PUBLISHER] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 44441319 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Note on Absolutely Unorderable Combinatory Algebras. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lusin%2C+Stefania%22">Lusin, Stefania</searchLink><relatesTo>1</relatesTo><i> slusin@dsi.unive.it</i><br /><searchLink fieldCode="AR" term="%22Salibra%2C+Antonino%22">Salibra, Antonino</searchLink><relatesTo>1</relatesTo><i> salibra@dsi.unive.it</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Aug2003, Vol. 13 Issue 4, p481-502. 22p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Combinatory+logic%22">Combinatory logic</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Axioms%22">Axioms</searchLink><br /><searchLink fieldCode="DE" term="%22Lambda+calculus%22">Lambda calculus</searchLink><br /><searchLink fieldCode="DE" term="%22Function+algebras%22">Function algebras</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+analysis%22">Mathematical analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Plotkin has conjectured that there exists an absolutely unorderable combinatory algebra, namely a combinatory algebra which cannot be embedded in another combinatory algebra admitting a nontrivial compatible partial order. In this paper we prove that a wide class of combinatory algebras admits extensions with a nontrivial compatible partial order. [ABSTRACT FROM PUBLISHER] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=44441319 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1093/logcom/13.4.481 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 22 StartPage: 481 Subjects: – SubjectFull: Combinatory logic Type: general – SubjectFull: Algebra Type: general – SubjectFull: Axioms Type: general – SubjectFull: Lambda calculus Type: general – SubjectFull: Function algebras Type: general – SubjectFull: Mathematical analysis Type: general Titles: – TitleFull: A Note on Absolutely Unorderable Combinatory Algebras. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lusin, Stefania – PersonEntity: Name: NameFull: Salibra, Antonino IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2003 Type: published Y: 2003 Identifiers: – Type: issn-print Value: 0955792X Numbering: – Type: volume Value: 13 – Type: issue Value: 4 Titles: – TitleFull: Journal of Logic & Computation Type: main |
| ResultId | 1 |
