Search results for "Axiom"

showing 10 items of 91 documents

Lawvere–Tierney sheaves in Algebraic Set Theory

2009

We present a solution to the problem of defining a counterpart in Algebraic Set Theory of the construction of internal sheaves in Topos Theory. Our approach is general in that we consider sheaves as determined by Lawvere-Tierney coverages, rather than by Grothendieck coverages, and assume only a weakening of the axioms for small maps originally introduced by Joyal and Moerdijk, thus subsuming the existing topos-theoretic results.

Algebraic setPure mathematicsLogicMathematics - Category TheoryMathematics - LogicTopos theoryPhilosophyMathematics::LogicMathematics::Algebraic GeometryMathematics::Category TheoryFOS: MathematicsCategory Theory (math.CT)Algebraic Set Theory sheavesLogic (math.LO)03C90 03G30 03F50AxiomMathematics
researchProduct

Flots de Smale en dimension 3: présentations finies de voisinages invariants d'ensembles selles

2002

Abstract Given a vector field X on a compact 3-manifold, and a hyperbolic saddle-like set K of that vector field, we consider all the filtering neighbourhood of K: by such, we mean any submanifold which boundary is tranverse to X, the maximal invariant of which is equal to K and which intersection with every orbit of X is connected. Up to topological equivalence, there is only a finite number of such neighbourhoods. We give a finite combinatorial presentation of the global dynamics on any such neighbourhood. A key step is the construction of a unique model of the germ of X along K; this model is, roughly speaking, the simplest three-dimensional manifold and the simplest Smale flow exhibitin…

Axiom ACombinatoricsStructural stabilitySmale flowsGermVector fieldGeometry and TopologyInvariant (mathematics)SubmanifoldHyperbolic dynamicsFinite setTopological equivalenceMathematicsTopology
researchProduct

Extropy: Complementary Dual of Entropy

2015

This article provides a completion to theories of information based on entropy, resolving a longstanding question in its axiomatization as proposed by Shannon and pursued by Jaynes. We show that Shannon's entropy function has a complementary dual function which we call "extropy." The entropy and the extropy of a binary distribution are identical. However, the measure bifurcates into a pair of distinct measures for any quantity that is not merely an event indicator. As with entropy, the maximum extropy distribution is also the uniform distribution, and both measures are invariant with respect to permutations of their mass functions. However, they behave quite differently in their assessments…

Bregman divergenceFOS: Computer and information sciencesStatistics and ProbabilitySettore MAT/06 - Probabilita' E Statistica MatematicaKullback–Leibler divergenceComputer Science - Information TheoryGeneral MathematicsFOS: Physical sciencesBinary numberMathematics - Statistics TheoryStatistics Theory (math.ST)Kullback–Leibler divergenceBregman divergenceproper scoring rulesGini index of heterogeneityDifferential entropyBinary entropy functionFOS: MathematicsEntropy (information theory)Statistical physicsDual functionAxiomMathematicsdifferential and relative entropy/extropy Kullback- Leibler divergence Bregman divergence duality proper scoring rules Gini index of heterogeneity repeat rate.Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniDifferential and relative entropy/extropyInformation Theory (cs.IT)Probability (math.PR)repeat ratePhysics - Data Analysis Statistics and ProbabilitydualityStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaMathematics - ProbabilityData Analysis Statistics and Probability (physics.data-an)Statistical Science
researchProduct

Complex powers and non-compact manifolds

2002

We study the complex powers $A^{z}$ of an elliptic, strictly positive pseudodifferential operator $A$ using an axiomatic method that combines the approaches of Guillemin and Seeley. In particular, we introduce a class of algebras, ``extended Weyl algebras,'' whose definition was inspired by Guillemin's paper on the subject. An extended Weyl algebra can be thought of as an algebra of ``abstract pseudodifferential operators.'' Many algebras of pseudodifferential operators are extended Weyl algebras. Several results typical for algebras of pseudodifferential operators (asymptotic completeness, construction of Sobolev spaces, boundedness between apropriate Sobolev spaces, >...) generalize to…

Class (set theory)Applied Mathematicsmedia_common.quotation_subjectMathematics - Operator AlgebrasAxiomatic systemMathematics::Spectral TheoryInfinityManifoldAlgebraSobolev spaceMathematics - Spectral TheoryOperator (computer programming)Mathematics - Analysis of PDEsCompleteness (order theory)FOS: MathematicsOperator Algebras (math.OA)Spectral Theory (math.SP)Mathematics::Symplectic GeometryAnalysisEigenvalues and eigenvectorsAnalysis of PDEs (math.AP)media_commonMathematics
researchProduct

The identity type weak factorisation system

2008

We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the right class of the weak factorisation system. This characterisation is applied to relate identity types and the homotopy theory of groupoids.

Class (set theory)Pure mathematicsGeneral Computer ScienceDependent type theoryHomotopiaType (model theory)Identity (music)Theoretical Computer Science510 - Consideracions fonamentals i generals de les matemàtiquesCombinatorics18C50Mathematics::Category TheoryFOS: MathematicsCategory Theory (math.CT)Univalent foundationsAxiomMathematicsHomotopy03B15; 18C50; 18B40Mathematics - Category TheoryIdentity type weak factorisation systemMathematics - LogicTipus Teoria dels03B15Type theory18B40Homotopy type theoryLogic (math.LO)Weak factorisation systemIdentity typeComputer Science(all)
researchProduct

Fuzzy $$\varphi $$ -pseudometrics and Fuzzy $$\varphi $$ -pseudometric Spaces

2017

By replacing the axiom \(m(x,x,t) = 1\) for all \(x\in X, t>0\) in the definition of a fuzzy pseudometric in the sense of George-Veeramani with a weaker axiom \(m(x,x,t) = \varphi (t)\) for all \(x\in X, t>0\) where \(\varphi : {\mathbb R}^+ \rightarrow (0,1]\) is a non-decreasing function, we come to the concept of a fuzzy \(\varphi \)-pseudometric space. Basic properties of fuzzy \(\varphi \)-pseudometric spaces and their mappings are studied. We show also an application of fuzzy \(\varphi \)-pseudometrics in the words combinatorics.

CombinatoricsBaire category theoremPseudometric spaceFunction (mathematics)Space (mathematics)Fuzzy logicAxiomCauchy sequenceMathematics
researchProduct

K4-free Graphs as a Free Algebra

2017

International audience; Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition to parallel composition and series composition, it suffices to consider the neutral elements of those operations and a unary transpose operation. Then we give a finite equational presentation and we prove it complete: two terms from the syntax are congruent if and only if they …

Completeness000 Computer science knowledge general worksGraph minors[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Graph theoryTree decompositions[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Àlgebra universalUniversal Algebra[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science::Discrete MathematicsComputer ScienceAxiomatisation[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
researchProduct

Learning with belief levels

2008

AbstractWe study learning of predicate logics formulas from “elementary facts,” i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is “practically” complete. Theorems presented in the paper in some sense confirm our hypothesis.

CompletenessAxiom systemsbusiness.industryComputer Networks and CommunicationsApplied Mathematics010102 general mathematicsInductive inference02 engineering and technologyInductive reasoning01 natural sciencesBelief levelsPredicate (grammar)EpistemologyTheoretical Computer ScienceTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics020204 information systems0202 electrical engineering electronic engineering information engineeringLearningArtificial intelligence0101 mathematicsbusinessAction axiomAxiomMathematicsJournal of Computer and System Sciences
researchProduct

Estimation and visualization of confusability matrices from adaptive measurement data

2010

Abstract We present a simple but effective method based on Luce’s choice axiom [Luce, R.D. (1959). Individual choice behavior: A theoretical analysis. New York: John Wiley & Sons] for consistent estimation of the pairwise confusabilities of items in a multiple-choice recognition task with arbitrarily chosen choice-sets. The method combines the exact (non-asymptotic) Bayesian way of assessing uncertainty with the unbiasedness emphasized in the classical frequentist approach. We apply the method to data collected using an adaptive computer game designed for prevention of reading disability. A player’s estimated confusability of phonemes (or more accurately, phoneme–grapheme connections) and l…

Computer sciencebusiness.industryApplied MathematicsBayesian probabilityConfusion matrixMachine learningcomputer.software_genreComputer gameVisualizationBayesian statisticsFrequentist inferencePairwise comparisonArtificial intelligencebusinesscomputerAlgorithmGeneral PsychologyAxiomJournal of Mathematical Psychology
researchProduct

Urban poverty: Measurement theory and evidence from American cities

2021

AbstractWe characterize axiomatically a new index of urban poverty that i) captures aspects of the incidence and distribution of poverty across neighborhoods of a city, ii) is related to the Gini index and iii) is consistent with empirical evidence that living in a high poverty neighborhood is detrimental for many dimensions of residents’ well-being. Widely adopted measures of urban poverty, such as the concentrated poverty index, may violate some of the desirable properties we outline. Furthermore, we show that changes of urban poverty within the same city are additively decomposable into the contribution of demographic, convergence, re-ranking and spatial effects. We collect new evidence …

Concentrated poverty Axiomatic Gini Decomposition Census ACS SpatialOrganizational Behavior and Human Resource ManagementCensusDecompositionIndex (economics)Sociology and Political SciencePovertybusiness.industryConcentrated povertyDistribution (economics)CensuConvergence (economics)Gini indexACSMetropolitan areaConcentrated povertyAxiomaticGiniDevelopment economicsSpatialbusinessEmpirical evidenceGeneral Economics Econometrics and FinancePublic finance
researchProduct