Search results for "Transitive relation"

showing 10 items of 74 documents

A Neo2 bayesian foundation of the maxmin value for two-person zero-sum games

1994

A joint derivation of utility and value for two-person zero-sum games is obtained using a decision theoretic approach. Acts map states to consequences. The latter are lotteries over prizes, and the set of states is a product of two finite sets (m rows andn columns). Preferences over acts are complete, transitive, continuous, monotonie and certainty-independent (Gilboa and Schmeidler (1989)), and satisfy a new axiom which we introduce. These axioms are shown to characterize preferences such that (i) the induced preferences on consequences are represented by a von Neumann-Morgenstern utility function, and (ii) each act is ranked according to the maxmin value of the correspondingm × n utility …

Statistics and ProbabilityComputer Science::Computer Science and Game TheoryEconomics and EconometricsTransitive relationVon Neumann–Morgenstern utility theoremMathematics (miscellaneous)Zero-sum gameExample of a game without a valueCardinal utilityStatistics Probability and UncertaintyTransferable utilityMathematical economicsFinite setSocial Sciences (miscellaneous)AxiomMathematicsInternational Journal of Game Theory
researchProduct

A Neurocomputational Approach to Trained and Transitive Relations in Equivalence Classes

2017

A stimulus class can be composed of perceptually different but functionally equivalent stimuli. The relations between the stimuli that are grouped in a class can be learned or derived from other stimulus relations. If stimulus A is equivalent to B, and B is equivalent to C, then the equivalence between A and C can be derived without explicit training. In this work we propose, with a neurocomputational model, a basic learning mechanism for the formation of equivalence. We also describe how the relatedness between the members of an equivalence class is developed for both trained and derived stimulus relations. Three classic studies on stimulus equivalence are simulated covering typical and at…

Stimulus equivalencePure mathematicslcsh:BF1-990Stimulus (physiology)Machine learningcomputer.software_genre03 medical and health sciencesBasic learning0302 clinical medicinePsychology0501 psychology and cognitive sciences050102 behavioral science & comparative psychologyNodal distanceEquivalence classGeneral PsychologyOriginal ResearchTransitive relationQuantitative Biology::Neurons and Cognitionbusiness.industryneurocomputational modelequivalence classes05 social sciencestransitive relationscategorizationlcsh:PsychologyHebbian theoryCategorizationArtificial intelligenceHebbian learningbusinessPsychologycomputer030217 neurology & neurosurgeryFrontiers in Psychology
researchProduct

Values of love: two forms of infinity characteristic of human persons

2020

AbstractIn his late reflections on values and forms of life from the 1920s and 1930s, Husserl develops the concept of personal value and argues that these values open two kinds of infinities in our lives. On the one hand personal values disclose infinite emotive depths in human individuals while on the other hand they connect human individuals in continuous and progressive chains of care. In order to get at the core of the concept, I will explicate Husserl’s discussion of personal values of love by distinguishing between five related features. I demonstrate that values of love (1) are rooted in egoic depts and define who we are as persons, (2) differ from objective values in being absolute …

SubjectivityPhilosophy of mindCognitive Neurosciencepersoonaintersubjectivityarvot (käsitykset)rakkaustunteetvaluesintersubjektiivisuusdevelopmenttimeminäTransitive relationpersonfenomenologiasubjektiivisuusEpistemologyPhilosophyHusserl EdmundinfinityEmotivevalue of love (Liebeswert)LiebeswertvocationPsychologyPhenomenology (psychology)IntersubjectivitylovePhenomenology and the Cognitive Sciences
researchProduct

Seifert manifolds admitting partially hyperbolic diffeomorphisms

2017

We characterize which 3-dimensional Seifert manifolds admit transitive partially hyperbolic diffeomorphisms. In particular, a circle bundle over a higher-genus surface admits a transitive partially hyperbolic diffeomorphism if and only if it admits an Anosov flow.

Surface (mathematics)Pure mathematicsMathematics::Dynamical SystemsCircle bundle[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]Dynamical Systems (math.DS)01 natural sciences[MATH.MATH-GN]Mathematics [math]/General Topology [math.GN]0103 physical sciencesFOS: MathematicsMSC: Primary: 37D30 37C15; Secondary: 57R30 55R05.Mathematics - Dynamical Systems0101 mathematicsMathematics::Symplectic GeometrySeifert spacesMathematics - General TopologyMathematicsTransitive relationAlgebra and Number TheoryApplied Mathematics010102 general mathematicsGeneral Topology (math.GN)Mathematics::Geometric TopologyFlow (mathematics)Partially hyperbolic diffeomorphisms010307 mathematical physicsDiffeomorphismAnalysis
researchProduct

Highly transitive actions of free products

2013

We characterize free products admitting a faithful and highly transitive action. In particular, we show that the group $\PSL_2(\Z)\simeq (\Z/2\Z)*(\Z/3\Z)$ admits a faithful and highly transitive action on a countable set.

Transitive actionHighly transitive actionsMSC: Primary: 20B22 20E06Group Theory (math.GR)01 natural sciencesBaire category Theorem[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]CombinatoricsFree products0103 physical sciencesFOS: MathematicsCountable set0101 mathematics20B22MathematicsTransitive relation20E06Group (mathematics)Mathematics::Operator Algebras010102 general mathematics20E06 20B2216. Peace & justiceFree productBaire category theorem010307 mathematical physicsGeometry and TopologyMathematics - Group Theory
researchProduct

Algebraic (2, 2)-transformation groups

2009

This paper contains the more significant part of the article with the same title that will appear in the Volume 12 of Journal of Group Theory (2009). In this paper we determine all algebraic transformation groups $G$, defined over an algebraically closed field $\sf k$, which operate transitively, but not primitively, on a variety $\Omega$, provided the following conditions are fulfilled. We ask that the (non-effective) action of $G$ on the variety of blocks is sharply 2-transitive, as well as the action on a block $\Delta$ of the normalizer $G_\Delta$. Also we require sharp transitivity on pairs $(X,Y)$ of independent points of $\Omega$, i.e. points contained in different blocks.

Transitive relationAlgebra and Number TheoryNaturwissenschaftliche Fakultät -ohne weitere Spezifikation-14L30permutation groupsBlock (permutation group theory)-Group Theory (math.GR)Permutation groupCentralizer and normalizerAction (physics)CombinatoricsFOS: Mathematicsddc:510Variety (universal algebra)Algebraically closed fieldAlgebraic numberMathematics - Group TheoryMathematicsJournal of Group Theory
researchProduct

Prosodic Phrasing and Transitivity in Head-Final Sentence Comprehension – ERP Evidence from German Ambiguous DPs

2010

In this article, we present an ERP study investigating the neurophysiological correlates of the interplay between prosodic phrasing and case information in head-final sentence processing. We examine German DP1-DP2-V constructions, in which the second DP can either be interpreted as a possessive modifier of the first DP (one-participant reading), or as a verbal argument (two-participant reading). An N400 on the determiner of the second DP is observed when either case information or prosodic phrasing biased toward the establishment of a two-participant reading, thus reflecting local processing costs associated with the introduction of a transitive event. By contrast, when the DPs are integrat…

Transitive relationDeterminerVerbArgument (linguistics)PsychologyPossessiveSentenceSentence processingN400Linguistics
researchProduct

Indexing Method for Transitive Relationships of Product Information

2008

To successfully use a relational database management system (RDBMS) as a repository for product information, the RDBMS must efficiently process and properly answer ontological queries. The key to processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. In particular, the transitive relationships (e.g., is-a, component-of relationships) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. We propose an efficient index using a numbering scheme (labeling scheme) to process queries over transitive relationships. (This paper is an extended version o…

Transitive relationInformation retrievalComputer Networks and CommunicationsRelational databasecomputer.internet_protocolComputer scienceSearch engine indexingInformationSystems_DATABASEMANAGEMENTOntology (information science)computer.software_genreNumberingDatabase indexNumbering schemeIndex (publishing)Relational database management systemArtificial IntelligenceTaxonomy (general)Product (mathematics)OntologycomputerSoftwareXML2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
researchProduct

On the satisfiability problem for fragments of two-variable logic with one transitive relation

2019

Abstract We study the satisfiability problem for two-variable first-order logic over structures with one transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential quantifiers are guarded by transitive atoms. As this fragment enjoys neither the finite model property nor the tree model property, to show decidability we introduce a novel model construction technique based on the infinite Ramsey theorem. We also point out why the technique is not sufficient to obtain decidability for the full two-variable logic with one transitive relation; hence, contrary to our previous claim, [FO$^2$ with one transitive relation is deci…

Transitive relationLogic010102 general mathematics0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsVariable (computer science)Arts and Humanities (miscellaneous)010201 computation theory & mathematicsHardware and Architecture0101 mathematicsBoolean satisfiability problemSoftwareMathematicsJournal of Logic and Computation
researchProduct

On C1 robust singular transitive sets for three-dimensional flows

1998

Abstract The main goal of this paper is to study robust invariant transitive sets containing singularities for C 1 flows on three-dimensional compact boundaryless manifolds: they are partially hyperbolic with volume expanding central direction. Moreover, they are either attractors or repellers. Robust here means that this property cannot be destroyed by small C 1 -perturbations of the flow.

Transitive relationMathematics::Dynamical SystemsFlow (mathematics)Property (programming)Mathematical analysisAttractorGravitational singularityGeneral MedicineInvariant (mathematics)MathematicsComptes Rendus de l'Académie des Sciences - Series I - Mathematics
researchProduct