Search results for "Equivalence relation"

showing 10 items of 27 documents

Nondeterministic operations on finite relational structures

1998

Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…

Discrete mathematicsFinite-state machineGeneral Computer ScienceComputer scienceLogicFormal languages (recognizable and context-free sets transducers)Unbounded nondeterminismMonad (functional programming)Symbolic computationHypergraphsFirst-order logicLogical theoryDecidabilityTheoretical Computer ScienceNondeterministic algorithmAlgebraDeterministic automatonFormal languageUniversal algebraEquivalence relationTree transducersRewritingComputer Science(all)Theoretical Computer Science
researchProduct

Two-Variable First-Order Logic with Equivalence Closure

2012

We consider the satisfiability and finite satisfiability problems for extensions of the two-variable fragment of first-order logic in which an equivalence closure operator can be applied to a fixed number of binary predicates. We show that the satisfiability problem for two-variable, first-order logic with equivalence closure applied to two binary predicates is in 2-NExpTime, and we obtain a matching lower bound by showing that the satisfiability problem for two-variable first-order logic in the presence of two equivalence relations is 2-NExpTime-hard. The logics in question lack the finite model property; however, we show that the same complexity bounds hold for the corresponding finite sa…

Discrete mathematicsGeneral Computer ScienceLogical equivalenceFinite model propertyGeneral MathematicsDescriptive complexity theorySatisfiabilityDecidabilityFirst-order logicCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Logic in Computer ScienceMaximum satisfiability problemClosure operatorEquivalence relationBoolean satisfiability problemMathematics2012 27th Annual IEEE Symposium on Logic in Computer Science
researchProduct

Logics with counting and equivalence

2014

We consider the two-variable fragment of first-order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NEXPTIME-complete. We further show that the corresponding problems for two-variable first-order logic with counting and two equivalences are both undecidable.

Discrete mathematicsLogical equivalenceComplexityHigher-order logicSatisfiabilityUndecidable problemStipulationCombinatoricsBinary predicateTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESEquivalence relationComputer Science::Logic in Computer ScienceEquivalence relationSatisfiabilityEquivalence (formal languages)MathematicsProceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
researchProduct

General aggregation operators based on a fuzzy equivalence relation in the context of approximate systems

2016

Our paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator. We consider properties of these approximations and explore their role in the context of extensional fuzzy sets with respect to the corresponding equivalence relation. We consider also upper and lower approximations of a t-norm extension of an ordinary aggregation operator. Finally, we describe an approximate system, considering the lattice of all general aggregation operators and the lattice of all fuzzy equivalence relations.

Discrete mathematicsPointwiseLogic05 social sciencesFuzzy set050301 educationContext (language use)02 engineering and technologyExtension (predicate logic)Lattice (discrete subgroup)Operator (computer programming)Artificial Intelligence0202 electrical engineering electronic engineering information engineeringEquivalence relationApplied mathematics020201 artificial intelligence & image processing0503 educationOrdered weighted averaging aggregation operatorMathematicsFuzzy Sets and Systems
researchProduct

A Note on Algebraic Sums of Subsets of the Real Line

2002

AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…

Discrete mathematicsRational numberLebesgue measurenull setsBaire propertyMathematics::LogicBorel equivalence relation03E15Borel setsalgebraic sumsPolish spaceGeometry and TopologyProperty of Baire26A21Borel setBorel measureReal line28A05AnalysisDescriptive set theoryMathematicsReal Analysis Exchange
researchProduct

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants

2018

We consider extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, pre-orders or partial orders). We prove that the only fragment that retains the finite (exponential) model property is GF2 with equivalence guards without equality. For remaining fragments we show that the size of a minimal finite model is at most doubly exponential. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NExpTime-upper bou…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTwo-variable logicGeneral Computer ScienceComputational complexity theoryLogicguarded fragmentBinary number0102 computer and information sciences01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatoricstransitive relationEquivalence relationfinite satisfiability problem0101 mathematicsEquivalence (formal languages)Integer programmingMathematicsDiscrete mathematicsTransitive relationNEXPTIMEcomputational complexity010102 general mathematicsLogic in Computer Science (cs.LO)Computational Mathematics010201 computation theory & mathematicsequivalence ralationACM Transactions on Computational Logic
researchProduct

On the proper homotopy invariance of the Tucker property

2006

A non-compact polyhedron P is Tucker if, for any compact subset K ⊂ P, the fundamental group π1(P − K) is finitely generated. The main result of this note is that a manifold which is proper homotopy equivalent to a Tucker polyhedron is Tucker. We use Poenaru’s theory of the equivalence relations forced by the singularities of a non-degenerate simplicial map.

Fundamental groupHomotopy lifting propertyApplied MathematicsGeneral MathematicsHomotopyMathematics::Optimization and ControlhomotopyproperComputer Science::Numerical AnalysisRegular homotopyCombinatoricsn-connectedPolyhedronEquivalence relationtucker propertySimplicial mapMathematics
researchProduct

Fractional-order nonlinear hereditariness of tendons and ligaments of the human knee

2020

In this paper the authors introduce a nonlinear model of fractional-order hereditariness used to capture experimental data obtained on human tendons of the knee. Creep and relaxation data on fibrous tissues have been obtained and fitted with logarithmic relations that correspond to power-laws with nonlinear dependence of the coefficients. The use of a proper nonlinear transform allows one to use Boltzmann superposition in the transformed variables yielding a fractional-order model for the nonlinear material hereditariness. The fundamental relations among the nonlinear creep and relaxation functions have been established, and the results from the equivalence relations have been contrasted wi…

LogarithmQuasi-linear viscoelasticityGeneral MathematicsGeneral Physics and AstronomyHarmonic (mathematics)02 engineering and technology01 natural sciences010305 fluids & plasmasTendonsSuperposition principle0203 mechanical engineeringtendons and ligaments0103 physical sciencesHumansEquivalence relationnonlinear hereditarinessKneesingle-integralMechanical PhenomenaMathematicsPolynomial (hyperelastic model)LigamentsMathematical analysisGeneral EngineeringRelaxation (iterative method)Biomechanical PhenomenaFractional calculusNonlinear system020303 mechanical engineering & transportsNonlinear DynamicsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
researchProduct

A choice of bilevel linear programming solving parameters: factoraggregation approach

2013

Our paper deals with the problem of choosing correct parameters for the bilevel linear program- ming solving algorithm proposed by M. Sakawa and I. Nishizaki. We suggest an approach based on fac- toraggregation, which is a specially designed general aggregation operator. The idea of factoraggregation arises from factorization by the equivalence relation generated by the upper level objective function. We prove several important properties of the factorag- gregation result regarding the analysis of param- eters in order to find an optimal solution for the problem. We illustrate the proposed method with some numerical and graphical examples, in particu- lar we consider a modification of the m…

Mathematical optimizationLinear programmingComputer scienceMonotonic functionFuzzy logicMultiobjective linear programming problemOperator (computer programming)Production planningBilevel linear programming problemFactorizationEquivalence relationBoundary value problem:MATHEMATICS::Applied mathematics [Research Subject Categories]General aggregation operator
researchProduct

Equivalence Relations on Stonian Spaces

1996

Abstract Quotient spaces of locally compact Stonian spaces which generalize in some sense the concept of Stone representation space of a Boolean algebra are investigated emphasizing the measure theoretical point of view, and a representation theorem for finitely additive measures is proved.

Mathematics(all)Representation theoremquotient spaceRiesz–Markov–Kakutani representation theoremGeneral Mathematicsba spacerepresentation of a space of measuresQuotient space (linear algebra)Stone representation spaceAlgebranormal Radon measureStonian spaceEquivalence relationLocally compact spaceStone's representation theorem for Boolean algebrasQuotientfinitely additive measureMathematicsAdvances in Mathematics
researchProduct