Results 1  10
of
31
Schema Equivalence in Heterogeneous Systems: Bridging Theory and Practice
, 1993
"... Current theoretical work offers measures of schema equivalence based on the information capacity of schemas. This work is based on the existence of abstract functions satisfying various restrictions between the sets of all instances of two schemas. In considering schemas that arise in practice, howe ..."
Abstract

Cited by 73 (2 self)
 Add to MetaCart
Current theoretical work offers measures of schema equivalence based on the information capacity of schemas. This work is based on the existence of abstract functions satisfying various restrictions between the sets of all instances of two schemas. In considering schemas that arise in practice, however, it is not clear how to reason about the existence of such abstract functions. Further, these notions of equivalence tend to be too liberal in that schemas are often considered equivalent when a practitioner would consider them to be different. As a result, practical integration methodologies have not utilized this theoretical foundation and most of them have relied on adhoc approaches. We present results that seek to bridge this gap. First, we consider the problem of deciding information capacity equivalence and dominance of schemas that occur in practice, i.e., those that can express inheritance and simple integrity constraints. We show that this problem is undecidable. This undecidab...
Intuitionistic Sets and Ordinals
 Journal of symbolic Logic
, 1996
"... Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by introducing plumpness, which strengthens transitivity. This clarifes the traditional development of successors and unions, making it intuitionistic; even the (classical) proof of trichotomy is made simpler. The definition is, however, recursive, and, as their name suggests, the plump ordinals grow very rapidly. Directedness must be defined hereditarily. It is orthogonal to the other four conditions, and the lower powerdomain construction is shown to be the universal way of imposing it. We treat ordinals as ordertypes, and develop a corresponding set theory similar to Osius’ transitive set objects. This presents Mostowski’s theorem as a reflection of categories, and settheoretic union is a corollary of the adjoint functor theorem. Mostowski’s theorem and the rank for some of the notions of ordinal are formulated and proved without the axiom of replacement, but this seems to be unavoidable for the plump rank. The comparison between sets and toposes is developed as far as the identification of replacement with completeness and there are some suggestions for further work in this area. Each notion of set or ordinal defines a free algebra for one of the theories discussed by Joyal and Moerdijk, namely joins of a family of arities together with an operation s satisfying conditions such as x ≤ sx, monotonicity or s(x ∨ y) ≤ sx ∨ sy. Finally we discuss the fixed point theorem for a monotone endofunction s of a poset with least element and directed joins. This may be proved under each of a variety of additional hypotheses. We explain why it is unlikely that any notion of ordinal obeying the induction scheme for arbitrary predicates will prove the pure result.
Extensionality versus constructivity
 Mathematical logic Quarterly
, 2000
"... We will analyze some extensions of MartinLöf’s constructive type theory by means of extensional set constructors and we will show that often the most natural requirements over them lead to classical logic or even to inconsistency. 1 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We will analyze some extensions of MartinLöf’s constructive type theory by means of extensional set constructors and we will show that often the most natural requirements over them lead to classical logic or even to inconsistency. 1
Toposes pour les vraiment nuls
 Advances in Theory and Formal Methods of Computing
, 1996
"... Restriction to geometric logic can enable one to define topological structures and continuous maps without explicit reference to topologies. This idea is illustrated with some examples and used to explain 1 ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Restriction to geometric logic can enable one to define topological structures and continuous maps without explicit reference to topologies. This idea is illustrated with some examples and used to explain 1
A Theory of Adjoint Functors —with some Thoughts about their Philosophical Significance
, 2005
"... The question “What is category theory ” is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of mathematical interest are usually characterized by some universal map ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
The question “What is category theory ” is approached by focusing on universal mapping properties and adjoint functors. Category theory organizes mathematics using morphisms that transmit structure and determination. Structures of mathematical interest are usually characterized by some universal mapping property so the general thesis is that category theory is about determination through universals. In recent decades, the notion of adjoint functors has moved to centerstage as category theory’s primary tool to characterize what is important and universal in mathematics. Hence our focus here is to present a theory of adjoint functors, a theory which shows that all adjunctions arise from the birepresentations of “chimeras ” or “heteromorphisms ” between the objects of different categories. Since representations provide universal mapping properties, this theory places adjoints within the framework of determination through universals. The conclusion considers some unreasonably effective analogies between these mathematical
LogicMotivated Choice of Fuzzy Logic Operators
, 2001
"... Many different "and" and "or"operations have been proposed for use in fuzzy logic; it is therefore important to select, for each particular application, the operations which are the best for this particular application. Several papers discuss the optimal choice of "and&q ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Many different "and" and "or"operations have been proposed for use in fuzzy logic; it is therefore important to select, for each particular application, the operations which are the best for this particular application. Several papers discuss the optimal choice of "and" and "or"operations for fuzzy control, when the main criterion is to get the stablest control (or the smoothest or the most robust or the fastestto compute). In reasoning applications, however, it is more appropriate to select operations which are the best in reflecting human reasoning, i.e., operations which are "the most logical". In this paper, we explain how we can use logic motivations to select fuzzy logic operations, and show the consequences of this choice. As one of the unexpected consequences, we get a surprising relation with the entropy techniques, well known in probabilistic approach to uncertainty.
Independence Conditions for Nets of Local Algebras as Sheaf Conditions
 In preparation
"... ar ..."
(Show Context)
λCalculus: Then & Now
, 2012
"... Notes derived from the slides presented at the conferences. A brief amount of text has been added for continuity. The author would be happy to hear reactions and suggestions. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Notes derived from the slides presented at the conferences. A brief amount of text has been added for continuity. The author would be happy to hear reactions and suggestions.
Why topology in the minimalist foundation must be pointfree
, 2013
"... We give arguments explaining why, when adopting a minimalist approach to constructive mathematics as that formalized in our twolevel minimalist foundation, the choice for a pointfree approach to topology is not just a matter of convenience or mathematical elegance, but becomes compulsory. The main ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We give arguments explaining why, when adopting a minimalist approach to constructive mathematics as that formalized in our twolevel minimalist foundation, the choice for a pointfree approach to topology is not just a matter of convenience or mathematical elegance, but becomes compulsory. The main reason is that in our foundation real numbers, either as Dedekind cuts or as Cauchy sequences, do not form a set.