Henrik Persson  Home/Search
Context
Related
| cs.chalmers.se/~henrik...PrimeIdeals.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~henrikp/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This paper exemplifies how one can give constructive interpretations of proofs which uses the non-constructive principle that any ideal is contained in a prime ideal. We consider a textbook example [AM69] which states that the coefficients of an invertible polynomial in a commutative ring with unit are nilpotent. This statement has a simple non-constructive proof which relies on the existence of certain prime ideals. We interpret this proof constructively, by using a constructive... (Update)
Active bibliography (related documents): More All
1.0: Valuations and Dedekind's Prague Theorem - Coquand, Persson (Correct)
0.3: A Constructive Proof of the Heine-Borel Covering Theorem for .. - Cederquist, Negri (1996) (Correct)
0.3: Gröbner Bases in Type Theory - Coquand, Persson (1998) (Correct)
Similar documents based on text: More All
0.1: A Distributed Algorithm in Agda: The Dining Philosophers Problem - Haiyan (1999) (Correct)
0.1: Computability and Complexity in Games - Vela Velupillai (Correct)
0.1: Constructive Topology and Combinatorics - Coquand (1991) (Correct)
BibTeX entry: (Update)
@misc{ persson-application,
author = "Henrik Persson",
title = "An Application of the Constructive Spectrum of a Ring",
url = "citeseer.ist.psu.edu/257056.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987 ACM
103 Introduction to Commutative Algebra (context) - Atiyah, MacDonald - 1969
65 The Implementation of ALF - a Proof Editor based on Martin-L.. - Magnusson - 1994
34 Classically and intuitionistically provably recursive functi.. (context) - Friedman - 1978
32 A User's Guide to ALF - Altenkirch, Gaspes et al. - 1994
14 Pretopologies and completeness proofs (context) - Sambin - 1995
14 Intuitionistic Formal Spaces - A First Communication (context) - Sambin - 1986
10 the computational content of the axiom of choice - Berardi, Bezem et al. - 1995
7 Computational content of classical logic - Coquand - 1996
4 A machine assisted formalization of pointfree topology in ty.. - Cederquist - 1994
4 Dynamical method in algebra: Effective Nullstellensatze (context) - Coste, Lombardi et al. - 1997
3 The homepage of the Agda type checker (context) - Coquand - 1998
3 Dimension of boolean valued lattices and rings (context) - Espanol - 1986
2 Polynomials and radical ideals (context) - Banaschewski, Vermeulen - 1996
1 Nontrivial uses of trivial rings (context) - Richman - 1988
1 emes de Chevalley-Tarski et remarques sur l (context) - Joyal - 1976
1 A new and elementary method to represent every complete bool.. (context) - Sambin - 1994
Documents on the same site (http://www.cs.chalmers.se/~henrikp/): More
Valuations and Dedekind's Prague Theorem - Coquand, Persson (Correct)
Integrated Development of Algebra in Type Theory - Coquand, Persson (1998) (Correct)
Certified Computer Algebra - Persson (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC