Search results for "CALL"

showing 10 items of 2320 documents

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

On Rough Sets in Topological Boolean Algebras

1994

We have focused on rough sets in topological Boolean algebras. Our main ideas on rough sets are taken from concepts of Pawlak [4] and certain generalizations of his constructions which were offered by Wiweger [7]. One of the most important results of this note is a characterization of the rough sets determined by regular open and regular closed elements.

Discrete mathematicsInterior algebraRough setField of setsBoolean algebras canonically definedCharacterization (mathematics)Stone's representation theorem for Boolean algebrasTopologyComplete Boolean algebraMathematics
researchProduct

Collection Principles in Dependent Type Theory

2002

We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation interpretation.

Discrete mathematicsInterpretation (logic)Dependent type theory constructive set theory propositions-as-typesComputer scienceConstructive set theoryIntuitionistic logicIntuitionistic type theoryDependent typeAlgebraMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDependent type theoryType theoryTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceDouble negationSet theoryRule of inferenceAxiom
researchProduct

Graded Involutions on Upper-triangular Matrix Algebras

2009

Let UTn be the algebra of n × n upper-triangular matrices over an algebraically closed field of characteristic zero. We describe all G-gradings on UTn by a finite abelian group G commuting with an involution (involution gradings).

Discrete mathematicsInvolution (mathematics)Pure mathematicsAlgebra and Number TheoryApplied MathematicsTriangular matrixAlgebraically closed fieldAbelian groupComputer Science::Information TheoryMathematicsAlgebra Colloquium
researchProduct

Quantum Finite Automata and Logics

2006

The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.

Discrete mathematicsLindström quantifierNested wordAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Computational ComplexityComputer Science::Digital LibrariesAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESMonoidal t-norm logicComputer Science::Programming LanguagesQuantum finite automataEquivalence (formal languages)T-norm fuzzy logicsComputer Science::Formal Languages and Automata TheoryAND gateMathematics
researchProduct

A property of connected Baire spaces

1997

Abstract We give a topological version of a classical result of F. Sunyer Balaguer's on a local characterization of real polynomials. This is done by studying a certain property on a class of connected Baire spaces, thus allowing us to obtain a local characterization of repeated integrals of analytic maps on Banach spaces.

Discrete mathematicsLocally connectedBanach spaceBaire category theoremGeometry and TopologyBaire spaceBaire spaceOpen mapping theorem (functional analysis)Baire measureSunyer Balaguer's TheoremComplete metric spaceMathematicsTopology and its Applications
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

𝑝-rational characters and self-normalizing Sylow 𝑝-subgroups

2007

Let G G be a finite group, p p a prime, and P P a Sylow p p -subgroup of G G . Several recent refinements of the McKay conjecture suggest that there should exist a bijection between the irreducible characters of p ′ p’ -degree of G G and the irreducible characters of p ′ p’ -degree of N G ( P ) \mathbf {N}_G(P) , which preserves field of values of correspondent characters (over the p p -adics). This strengthening of the McKay conjecture has several consequences. In this paper we prove one of these consequences: If p > 2 p>2 , then G G has no non-trivial p ′ p’ -degree p p -rational irreducible characters if and only if N G ( P ) = P \mathbf {N}_G(P)=P .

Discrete mathematicsMathematics (miscellaneous)Locally finite groupSylow theoremsMathematicsRepresentation Theory of the American Mathematical Society
researchProduct

On the structure of the ultradistributions of Beurling type

2008

Let O be a nonempty open set of the k-dimensional euclidean space Rk. In this paper, we give a structure theorem on the ultradistributions of Beurling type in O. Also, other structure results on certain ultradistributions are obtained, in terms of complex Borel measures in O.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsAlgebra and Number TheoryEuclidean spaceRiesz–Markov–Kakutani representation theoremApplied MathematicsOpen setStructure (category theory)Banach spaceType (model theory)Computational MathematicsLocally convex topological vector spaceGeometry and TopologyAnalysisStructured program theoremMathematicsRevista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
researchProduct

A Riemann manifold structure of the spectra of weighted algebras of holomorphic functions

2009

[EN] In this paper we give general conditions on a countable family V of weights on an unbounded open set U in a complex Banach space X such that the weighted space HV (U) of holomorphic functions on U has a Frechet algebra structure. For such weights it is shown that the spectrum of HV(U) has a natural analytic manifold structure when X is a symmetrically regular Banach space, and in particular when X = C-n. (C) 2009 Elsevier Ltd. All rights reserved.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsFréchet algebraWeighted space of holomorphic functionsHolomorphic functional calculusInfinite-dimensional vector functionSpectrum (functional analysis)Holomorphic functionFrechet algebraBanach manifoldAnalytic manifold structureAnalytic manifoldBergman spaceSymmetrically regular Banach spaceGeometry and TopologyMATEMATICA APLICADAWeighted spaceMathematicsTopology
researchProduct