Results 21 to 30 of about 107 (106)
Exact Unification and Admissibility [PDF]
Logical Methods in Computer Science, 2015 A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics.
George Metcalfe, Leonardo Cabrer
doaj +1 more source
Crystals, 2021 Classical nucleation theory (CNT), which was established about 90 years ago, represents the most commonly used theory in describing nucleation processes.
Fajun Zhang +3 more
doaj +1 more source
Logic of Typical and Atypical Instances of a Concept—A Mathematical Model
Axioms, 2019 In this paper, we give a mathematical model of the logic of determination of objects (LDO) based on preordered sets, and a mathematical model of the logic of typical and atypical instances (LTA). We prove that LTA is an extension of LDO.
Jean-Pierre Desclés +1 more
doaj +1 more source
, 2013 Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity $O(n^{3}m)$, compares favourably with ...
Gaur, Manish, Arun-Kumar, S.
openaire +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 The contribution aims to create hypergroups of linear first-order partial differential operators with proximities, one of which creates a tolerance semigroup on the power set of the mentioned differential operators.
Chvalina Jan +1 more
doaj +1 more source
Aerospace, 2022 Inflight catering services are crucial for air travel. Airlines provide food and beverages to the passengers during the flight with different options depending on, e.g., the flying class, distance, and type of service.
Rafael Mortensen Ernits +4 more
doaj +1 more source
PHYSICO-MATHEMATICAL SERIES, 2018 In this paper, we investigate universal objects in the class of positive preorders with respect to computable reducibility, we constructed a computable numbering of this class and proved theorems on the existence of a universal positive lattice and a universal weakly precomplete.
null Badaev S.A. +3 more
openaire +1 more source
The right indemnity in the case of expropriation constraint reiteration
Aestimum, 2013 Section 39 of the current consolidated expropriation act states: “while expecting a systematic re-regulation of the matter, in the case of reiteration of a preordered constraint or a practical expropriation constraint, the estate owner is entitled to an ...
Stefano Carrer
doaj +1 more source
On the use of partial orders in uniform spaces
Applied General Topology, 2003 We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditions and four different convergence conditions yield 36 completeness properties, each of which turns out to be equivalent to a known form of completeness ...
Bruce S. Burdick
doaj +1 more source
Profile Trees for Büchi Word Automata, with Application to Determinization [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 The determinization of Buchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Schewe,
Seth Fogarty +3 more
doaj +1 more source