Results 221 to 230 of about 54,001 (265)

Closure, Properties and Closure Properties of Multirelations

2015
Multirelations have been used for modelling games, protocols and computations. They have also been used for modelling contact, closure and topology. We bring together these two lines of research using relation algebras and more general algebras. In particular, we look at various properties of multirelations that have been used in the two lines of ...
Rudolf Berghammer, Walter Guttmann
openaire   +1 more source

Closure properties of GapP and #P

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, 2002
We classify the relativizable closure properties of GapP, solving a problem posed by (Hertrampf et al., 1995). We also give a simple proof of their classification of functions that are relativizable closure properties of #P.
openaire   +2 more sources

UNCOUNTABLE ORTHOGONALITY IS A CLOSURE PROPERTY

Bulletin of the London Mathematical Society, 2001
It is shown that, for λ > ω, λ-orthogonality classes in locally λ-presentable categories coincide with full subcategories that are closed under limits and under λ-directed colimits. This comes as a surprise, since the statement is known to be false for λ = ω.
Hébert, M., Rosický, J.
openaire   +1 more source

On the Closure Properties of Robotic Grasping

The International Journal of Robotics Research, 1995
The form-closure and force-closure properties of robotic grasp ing are investigated. Loosely speaking, these properties are related to the capability of the robot to inhibit motions of the workpiece in spite of externally applied forces.
openaire   +1 more source

Retraction closure property

Algebra universalis, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bošnjak, Ivica, Madarász, Rozália
openaire   +2 more sources

Closure properties of the relevation transform*

Naval Research Logistics Quarterly, 1985
AbstractSufficient conditions under which the relevation of two probability distributions is (i) NBU, (ii) IFRA, (iii) IFR are derived. The result for case (iii) corrects an error in a previous article by Baxter.
Shanthikumar, J. G., Baxter, Laurence A.
openaire   +1 more source

Closure properties of parametric subcompleteness

Archive for Mathematical Logic, 2018
For an ordinal $$\varepsilon $$ , I introduce a variant of the notion of subcompleteness of a forcing poset, which I call ...
openaire   +1 more source

Definability properties and the congruence closure

Archive for Mathematical Logic, 1990
The author defines a notion of a thin quantifier and uses it to prove some interesting general results of the failure of the \(\Delta\)- interpolation theorem and Beth's definability theorem in logics defined from generalized quantifiers. Many of the results of the paper are connected to the failure of the uniform reduction property for quotients.
openaire   +2 more sources

Some Closure Properties of Finite Definitions

Studia Logica, 2001
Systems where circular definitions are allowed and the defined predicates are associated with revision rules (instead of extensions) have been studied by Gupta and Belnap. The set of finite definitions is not recursive (Gupta), so there arises the problem to characterize this set in terms of closure conditions.
openaire   +2 more sources

Pseudo-inversion: closure properties and decidability

Natural Computing, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa   +5 more
openaire   +1 more source