<--- Back to Details
First PageDocument Content
Mathematics / Algebra / Theoretical computer science / Modular arithmetic / Logic in computer science / Congruence relation / Equivalence / Closure / Rewriting / Congruence lattice problem / Congruence subgroup
Date: 2005-02-02 07:20:48
Mathematics
Algebra
Theoretical computer science
Modular arithmetic
Logic in computer science
Congruence relation
Equivalence
Closure
Rewriting
Congruence lattice problem
Congruence subgroup

Proof-producing Congruence Closure Robert Nieuwenhuis? and Albert Oliveras?? Technical University of Catalonia, Jordi Girona 1, 08034 Barcelona, Spain www.lsi.upc.es/~roberto www.lsi.upc.es/~oliveras Abstract. Many appl

Add to Reading List

Source URL: www.lsi.upc.edu

Download Document from Source Website

File Size: 222,86 KB

Share Document on Facebook

Similar Documents

551  Documenta Math. The Eisenstein Ideal and Jacquet-Langlands Isogeny over Function Fields

551 Documenta Math. The Eisenstein Ideal and Jacquet-Langlands Isogeny over Function Fields

DocID: 1pV1P - View Document

43  Documenta Math. Hasse Invariant and Group Cohomology Bas Edixhoven, Chandrashekhar Khare

43 Documenta Math. Hasse Invariant and Group Cohomology Bas Edixhoven, Chandrashekhar Khare

DocID: 1pMVR - View Document

671  Documenta Math. Arithmetic of a fake projective plane and related elliptic surfaces

671 Documenta Math. Arithmetic of a fake projective plane and related elliptic surfaces

DocID: 1plgA - View Document

351  Doc. Math. J. DMV On the Cuspidal Divisor Class Group of a Drinfeld Modular Curve

351 Doc. Math. J. DMV On the Cuspidal Divisor Class Group of a Drinfeld Modular Curve

DocID: 1oSes - View Document

Sage Reference Manual: Modular Symbols Release 6.7 The Sage Development Team

Sage Reference Manual: Modular Symbols Release 6.7 The Sage Development Team

DocID: 1gnht - View Document