Search results for "Logics"

showing 10 items of 124 documents

Matemātika

1994

Differential equationsLoģikaFunkcionālanalīzeAlgebraFunctional analysis:MATHEMATICS [Research Subject Categories]TopoloģijaAproksimāciju teorijaMatemātikaApproximation theoryDiferenciālvienādojumiLogicsTopology
researchProduct

Minimal forbidden words and symbolic dynamics

1996

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.

Discrete mathematicsFactorial010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesInvariant (physics)16. Peace & justice01 natural sciencesCombinatorics010201 computation theory & mathematicsTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSInformation complexityFormal language0101 mathematicsComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUSMathematicsofComputing_DISCRETEMATHEMATICSMathematics
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

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

Balls into non-uniform bins

2014

Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…

Discrete mathematicsMathematical optimizationComputational complexity theoryComputer Networks and CommunicationsComputer scienceDistributed computingAstrophysics::Cosmology and Extragalactic AstrophysicsPhysics::Data Analysis; Statistics and ProbabilityLoad balancing (computing)BinTheoretical Computer ScienceLoad managementCapacity planningArtificial IntelligenceHardware and ArchitectureTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYBounded functionBall (bearing)Resource allocationHardware_ARITHMETICANDLOGICSTRUCTURESGame theorySoftwareMathematicsMathematicsofComputing_DISCRETEMATHEMATICS2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
researchProduct

Polynomial method to study the entanglement of pure N-qubit states

2009

We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the number of unentangled qubits of pure N-qubit states.

Discrete mathematicsPhysicsPolynomialQuantum PhysicsQuantum t-designSettore FIS/02 - Fisica Teorica Modelli E Metodi MatematiciCluster stateFOS: Physical sciencesQuantum entanglementQuantum PhysicsPolinomiMeccanica quantisticaAtomic and Molecular Physics and OpticsSettore FIS/03 - Fisica Della MateriaEntanglementSeparable stateComputer Science::Emerging TechnologiesQubitQuantum mechanicsComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONW stateHardware_ARITHMETICANDLOGICSTRUCTURESQuantum Physics (quant-ph)Quantum teleportation
researchProduct

Counting in the Two Variable Guarded Logic with Transitivity

2005

We show that the extension of the two-variable guarded fragment with transitive guards (GF+TG) by functionality statements is undecidable. This gives immediately undecidability of the extension of GF+TG by counting quantifiers. The result is optimal, since both the three-variable fragment of the guarded fragment with counting quantifiers and the two-variable guarded fragment with transitivity are undecidable. We also show that the extension of GF+TG with functionality, where functional predicate letters appear in guards only, is decidable and of the same complexity as GF+TG. This fragment captures many expressive modal and description logics.

Discrete mathematicsTransitive relationGuarded logicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESFragment (logic)Description logicFunctional predicateTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSExtension (predicate logic)Undecidable problemMathematicsDecidability
researchProduct

"Table 2" of "Study of the Leptonic Decays of the $Z^0$ Boson"

1990

No t-channel subtraction. Statistical errors only.

E+ E- --> E+ E-4.414E+014.752E+01Electron production88.28-95.04ElasticE+ E- ScatteringIntegrated Cross SectionData_CODINGANDINFORMATIONTHEORYHardware_ARITHMETICANDLOGICSTRUCTURESCross SectionSIGComputer Science::Information Theory
researchProduct

"Table 1" of "Study of the Leptonic Decays of the $Z^0$ Boson"

1990

E+ E- final state is t-channel subtracted.

E+ E- --> TAU+ TAU-4.414E+014.752E+01Electron production88.28-95.04Integrated Cross SectionE+ E- --> LEPTON+ LEPTON-Data_CODINGANDINFORMATIONTHEORYCross SectionSIGMuon productionE+ E- --> E+ E-ElasticE+ E- --> MU+ MU-E+ E- ScatteringExclusiveHardware_ARITHMETICANDLOGICSTRUCTURESTau productionComputer Science::Information Theory
researchProduct

Institutional distance and international networking

2017

We focus on how small- and medium-sized enterprises (SMEs) adapt to differences in institutional logics (values, beliefs, and rules) in their networking when they enter an institutionally distant market. We address gaps in the literature, relating to the role of institutional logics in SME internationalization, and how institutional distance affects the formation of network ties. We show how the social interaction involved in internationalization is embedded in the institutional logics followed by partnering actors. Specifically, we demonstrate how institutional distance may constrain the networking activities of SMEs and identify practices that may support successful internationalization. …

Economics and EconometricsFocus (computing)business.industry05 social sciencesverkostoituminennetworking (making contacts)small and medium-sized enterprisesSMEsinstitutional logicsDevelopmentPublic relationsinstitutional distanceInternationalization0502 economics and businessinternationalisation050211 marketingBusiness and International Managementbusinessta512kansainvälistyminenpienet ja keskisuuret yritykset050203 business & managementEntrepreneurship and Regional Development
researchProduct