Search results for " In C"

showing 10 items of 586 documents

Frames for fusions of modal logics

2018

Let us consider multimodal logics and . We assume that is characterised by a class of connected frames, and there exists an -frame with a so-called -starting point. Similarly, the logic is characterised by a class of connected frames, and there exists an -frame with a -starting point. Using isomorphic copies of the frames and , we construct a connected frame which characterises the fusion . The frame thus obtained has some useful properties. Among others, is countable if both and are countable, and there is a special world of the frame such that any formula is valid in the frame if and only if it is valid at the point . We also describe a similar construction where we assume the existence o…

Class (set theory)LogicComputer scienceExistential quantificationFrame (networking)Multimodal logicMultimodal logic0102 computer and information sciences01 natural sciencesAlgebraPhilosophyModal010201 computation theory & mathematicsComputer Science::Logic in Computer SciencePoint (geometry)fusion of modal logicsJournal of Applied Non-Classical Logics
researchProduct

On Horn spectra

1991

Abstract A Horn spectrum is a spectrum of a Horn sentence. We show that to solve Asser's problem, and consequently the EXPTIME = ? NEXPTIME question it suffices to consider the class of Horn spectra. We also pose the problem whether or not the generator of every Horn spectrum is a spectrum. We prove that from a negative solution of the generator problem, a negative answer for the EXPTIME = ? NEXPTIME question follows. Some other relations between the generator problem and Asser's problem are given. Finally, the relativized version of the generator problem is formulated and it is shown that it has an affirmative solution for some oracles, and a negative solution for some others.

Class (set theory)NEXPTIMEGeneral Computer ScienceFrench hornComputabilitySpectrum (functional analysis)EXPTIMEOracleTheoretical Computer ScienceCombinatoricsComputer Science::Logic in Computer ScienceComputer Science::Formal Languages and Automata TheoryComputer Science(all)Generator (mathematics)MathematicsTheoretical Computer Science
researchProduct

Are locally finite MV-algebras a variety?

2021

We answer Mundici's problem number 3 (D. Mundici. Advanced {\L}ukasiewicz calculus. Trends in Logic Vol. 35. Springer 2011, p. 235): Is the category of locally finite MV-algebras equivalent to an equational class? We prove: (i) The category of locally finite MV-algebras is not equivalent to any finitary variety. (ii) More is true: the category of locally finite MV-algebras is not equivalent to any finitely-sorted finitary quasi-variety. (iii) The category of locally finite MV-algebras is equivalent to an infinitary variety; with operations of at most countable arity. (iv) The category of locally finite MV-algebras is equivalent to a countably-sorted finitary variety. Our proofs rest upon th…

Class (set theory)Pure mathematicsAlgebra and Number Theory06D35 (Primary) 18C05 (Secondary)Duality (mathematics)Mathematics - Category TheoryMathematics - LogicArityMathematical proofComputer Science::Logic in Computer ScienceMathematics::Category TheoryFOS: MathematicsCountable setFinitaryCategory Theory (math.CT)Variety (universal algebra)Logic (math.LO)Categorical variableMathematics
researchProduct

Wellfounded Trees and Dependent Polynomial Functors

2004

We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by in- vestigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed cat- egories.

Class (set theory)Pure mathematicsCartesian closed categoryFunctorType theoryMathematics::Category TheoryComputer Science::Logic in Computer ScienceWellfounded trees locally cartesian closed categories categorical logicTree (set theory)PrewellorderingCategory theoryForgetful functorMathematics
researchProduct

Local minimizers and gamma-convergence for nonlocal perimeters in Carnot groups

2020

We prove the local minimality of halfspaces in Carnot groups for a class of nonlocal functionals usually addressed as nonlocal perimeters. Moreover, in a class of Carnot groups in which the De Giorgi's rectifiability Theorem holds, we provide a lower bound for the $\Gamma$-liminf of the rescaled energy in terms of the horizontal perimeter.

Class (set theory)Pure mathematicsControl and OptimizationCarnot groups calibrations nonlocal perimeters/ Γ-convergence sets of finite perimeter rectifiabilityMathematics::Analysis of PDEssets of finite perimetervariaatiolaskentaComputer Science::Computational Geometry01 natural sciencesUpper and lower boundsdifferentiaaligeometriasymbols.namesakeMathematics - Analysis of PDEs510 MathematicsMathematics - Metric GeometryComputer Science::Logic in Computer ScienceConvergence (routing)FOS: MathematicsMathematics::Metric Geometry0101 mathematicscalibrationsMathematicsnonlocal perimeters010102 general mathematicsrectifiabilityryhmäteoriaMetric Geometry (math.MG)matemaattinen optimointi010101 applied mathematicsComputational MathematicsΓ-convergenceΓ-convergenceCarnot groupsControl and Systems EngineeringsymbolsCarnot cycleAnalysis of PDEs (math.AP)ESAIM: Control, Optimisation and Calculus of Variations
researchProduct

Risposta teorico - sperimentale di colonne presso-inflesse in c.a. in assenza e in presenza di rinforzi

2014

Colonne in c.a. Pressoflessione RinforziSettore ICAR/09 - Tecnica Delle Costruzioni
researchProduct

On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

2005

We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.

CombinatoricsDiscrete mathematicsTransitive relationTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESPhraseComputational complexity theoryComputer Science::Logic in Computer SciencePredicate (mathematical logic)Decision problemBoolean satisfiability problemSentenceDecidabilityMathematics
researchProduct

On bijections vs. unary functions

1996

A set of finite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quantification is over relations of arity 2. In [DLS95] subclasses of Binary NP were considered, in which the second order quantifiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in a three-level linear hierarchy, the levels of which are represented by bijections, successor relations and unary functions respectively.

CombinatoricsSet (abstract data type)Range (mathematics)Unary operationHierarchy (mathematics)Computer Science::Logic in Computer ScienceOrder (group theory)Unary functionArityBijection injection and surjectionComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct

Stochastic analysis of dynamical systems with delayed control forces

2006

Abstract Reduction of structural vibration in actively controlled dynamical system is usually performed by means of convenient control forces dependent of the dynamic response. In this paper the existent studies will be extended to dynamical systems subjected to non-normal delta-correlated random process with delayed control forces. Taylor series expansion of the control forces has been introduced and the statistics of the dynamical response have been obtained by means of the extended Ito differential rule. Numerical application provided shows the capabilities of the proposed method to analyze stochastic dynamic systems with delayed actions under delta-correlated process contrasting statist…

Computational methods in classical mechanicNumerical AnalysisDynamical systems theoryStochastic processApplied MathematicsStochastic analysis methodsProcess (computing)General linear dynamical systemDynamical systemLinear dynamical systemsymbols.namesakeControl theoryModeling and SimulationTaylor seriessymbolsNonlinear dynamics and nonlinear dynamical systemDifferential (infinitesimal)Reduction (mathematics)MathematicsCommunications in Nonlinear Science and Numerical Simulation
researchProduct