We generalize a major portion of the classical theory of Cand C embedded subspaces to pointfree topology, where the corresponding notions are frame Cand C -quotients. The central results characterize these quotients and generalize Urysohns Extension Theorem, among others. The proofs require calculations in CL, the archimedean f -ring of frame maps from the topology of the reals into the frame L. We give a number of applications of the central results. Contents 1. Introduction 2 2. Background 2 2.1. Frames 2 2.2. Uniform frames 6 2.3. Archimedean f -rings 7 3. Calculating in CL 10 3.1. The fundamental formula 11 3.2. Cozero facts 12 3.3. Division in CL 16 4. Completeness properties of CL 17 4.1. The uniform completeness of CL 17 4.2. The -completeness of CL 21 5. Cozero covers 25 5.1. Principal covers 25 5.2. Linked covers and towers 28 6. Complete separation 34 6.1. Complete separation in archimedean f -rings 34 6.2. Complete separation in frames 37 7. C-quotients and C -quotients 40 7.1. C -quotients 40 7.2. C-quotients 42 8. Applications 47 8.1. Maximal extensions of frame maps into dense quotients 47 Date: January 1, 2003. 1991 Mathematics Subject Classication. Primary 06D22, 06F25; Secondary 54B30, 54G05, 54G10, 18B30. Key words and phrases. frame, C -embedded subspace, archimedean f -ring. File name: cextens3.tex. 1 2 RICHARD N. BALL AND JOANNE WALTERS-WAYLAND 8.2. Dense quotients of completely regular frames 50 8.3. Normality 55 8.4. Disconnectivity 56 References 61 1. Introduction Cand C embedded subspaces play a central role in general topology, and the corresponding frame quotients, here termed Cand C -quotients, are no less important to pointfree topology. Indeed, the characterizations of these quotients draw together many of the central strands of frame theory. But what the pointfree formulation adds to the classical theory is a remarkable combination of elegance of statement, simplicity of proof, and increase of extent. The central results are the frame characterizations of Cand C -quotients, Theorems 7.1.1 and 7.2.7. Sections 2-6 are ground-clearing and machinery-building for these results, and Section 8 consists of applications of them. Crucial to both theorems is the preservation of certain features of the cozero parts of the underlying frames. Covering properties also play an important role, and such properties naturally tie in closely with uniformities. In particular, the characterization of C-quotients leads to the study of what might be called the geometry of cozero covers. Because a good deal of machinery is required to tie together the long list of concepts upon which these embeddings impinge, we mention here only one particularly novel and interesting completeness feature of CL which emerged; we call it -completeness. In order to close the circles of ideas we found it necessary to employ the algebraic properties of CL as an archimedean f -ring. Roughly sixty percent of the arguments hinge on the algebra, even though a much smaller percentage of the results themselves mention it. This, of course, is squarely in the tradition of classical general topology, but it is a heretofore underused technique for the study of frames. And this may be the central thrust of our work: archimedean f -rings are just as important for understanding frames as they are for understanding general topology. Finally, it is a pleasure to record our gratitude to a generous and erudite referee, whose suggestions signicantly improved the exposition of these results. 2. Background In this section we briey record the denitions and standard results necessary to read this article. Although all the results are well known, we include a few proofs to spare the uninitiated reader the trouble of recovering information which is sometimes di¢ cult to dig out of the literature. 2.1. Frames. A frame is a complete lattice L with top element> and bottom element ? satisfying the frame distributivity law a ^ _

/pdf/c-and-c-quotients-in-pointfree-topology-rhgjc161lz.pdf

C- and C*-quotients in pointfree topology

We give a constructive proof of McNaughton's theorem stating that every piecewise linear function with integral coefficients is representable by some sentence in the infinite-valued calculus of Lukasiewicz. For the proof we only use Minkowski's convex body theorem and the rudiments of piecewise linear topology.

https://www.cambridge.org/core/services/aop-cambridge-core/content/view/05BB567F15702061A9D2E6E0A7C39553/S0022481200020004a.pdf/div-class-title-a-constructive-proof-of-mcnaughton-s-theorem-in-infinite-valued-logic-div.pdf

A constructive proof of McNaughton's theorem in infinite-valued logic

L-algebras, self-similarity, and l-groups

https://home.fau.edu/wmcgove1/web/Papers/finaledr.pdf

Bézout rings with almost stable range 1

Right l-groups, geometric Garside groups, and solutions of the quantum Yang–Baxter equation

The probability of splitters in a list

2 Hardware topics deemed necessary for computer scienc e majors (such as H1 H7 on p .150 of [C78}) are usually covered in a computer organization course or computer architecture course . However, they are usually only discussed . Unlik e software topics, which afford more convenient "hands-on" experimentation, hardware topics are relagated to lectures and pape r and pencil exercises . The main reason for this is, of course, th e logistical problems in setting up an appropriate lab and course . Despite these problems, a laboratory course involving hardwar e can be successfully attempted . One way of overcoming the logistical problems is to enlist the support of a department wit h both the space and experience to pull off such a course . This i s what happened at Denison when such a course was planned . I t is important to note that this course never would have gotte n off the ground if not for the generous support of our Physics department, who also saw the benefits . The computer science students in this course are upperclassmen, have all had a traditional course in computer architecture and have done assembley language programming (on a VAX) . Every computer science student has had the equivalent of CS 1 CS4 and CS7 described in [C78] and frequently considerabl y more . We don't think that this much background is necessary , however .

A laboratory based microprocessor course

1: Fundamentals- Section 1: Preliminaries and Basic Examples- Section 2: Subobjects and Morphisms- 2: Bernau's representation for Archimedean ?-groups- 3: The Conrad-Harvey-Holland Representation- 4: Represent able and Normal-valued ?-groups- Section 1: The Lorenzen Representation for ?-groups- Section 2: Normal-valued ?-groups- 5: Holland's Embedding Theorem- 6: Free ?-groups- 7: Varieties of ?-groups- Section 1: The lattice of Varieties- Section 2: Covers of the Abelian Variety- Section 3: The Cardinality of the lattice of ?-group Varieties- 8: Completions of Representable and Archimedean ?-groups- Section 1: Completions of Representable ?-groups- Section 2: Completions of Archimedean ?-groups- 9: The Lateral Completion- 10: Finite-valued and Special-valued ?-groups- 11: Groups of Divisibility- Appendix: A Menagerie of Examples- Section 1: Varieties of ?-groups- Section 2: Torsion and Radical Classes of ?-groups- Section 3: Examples of Lattice-ordered Groups- Author Index

Lattice-Ordered Groups: An Introduction

Lattice-ordered groups

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Todd Feil

Author Tools

Chat about Author

Papers

The probability of splitters in a list

A laboratory based microprocessor course

Lattice-Ordered Groups: An Introduction

Lattice-ordered groups