Sciweavers

922 search results - page 101 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
JSYML
2006
84views more  JSYML 2006»
15 years 6 months ago
Bounded modified realizability
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...
Fernando Ferreira, Ana Nunes
GC
2007
Springer
15 years 6 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen
APAL
2004
111views more  APAL 2004»
15 years 6 months ago
Concept lattices and order in fuzzy logic
The theory of concept lattices (i.e. hierarchical structures of concepts in the sense of Port-Royal school) is approached from the point of view of fuzzy logic. The notions of par...
Radim Belohlávek
ICSE
2008
IEEE-ACM
16 years 7 months ago
A verification system for timed interval calculus
Timed Interval Calculus (TIC) is a highly expressive set-based notation for specifying and reasoning about embedded real-time systems. However, it lacks mechanical proving support...
Chunqing Chen, Jin Song Dong, Jun Sun 0001
CADE
2005
Springer
16 years 6 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau