Sciweavers

3658 search results - page 348 / 732
» The logic of proofs, semantically
Sort
View
CADE
2006
Springer
16 years 7 months ago
Flyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
Tobias Nipkow, Gertrud Bauer, Paula Schultz
CIE
2006
Springer
15 years 10 months ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
JUCS
2007
102views more  JUCS 2007»
15 years 6 months ago
Pedagogical Natural Deduction Systems: the Propositional Case
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
Loïc Colson, David Michel
NDJFL
2000
74views more  NDJFL 2000»
15 years 6 months ago
Frege's New Science
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
Aldo Antonelli, Robert May
HEURISTICS
2006
102views more  HEURISTICS 2006»
15 years 6 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson