Enhancement of Mizar Texts with Transitivity Property of Predicates

Author(s):  
Artur Korniłowicz
2017 ◽  
Vol 39 (06) ◽  
pp. 1637-1667 ◽  
Author(s):  
VILLE SALO

We show that on the four-symbol full shift, there is a finitely generated subgroup of the automorphism group whose action is (set-theoretically) transitive of all orders on the points of finite support, up to the necessary caveats due to shift-commutation. As a corollary, we obtain that there is a finite set of automorphisms whose centralizer is $\mathbb{Z}$ (the shift group), giving a finitary version of Ryan’s theorem (on the four-symbol full shift), suggesting an automorphism group invariant for mixing subshifts of finite type (SFTs). We show that any such set of automorphisms must generate an infinite group, and also show that there is also a group with this transitivity property that is a subgroup of the commutator subgroup and whose elements can be written as compositions of involutions. We ask many related questions and prove some easy transitivity results for the group of reversible Turing machines, topological full groups and Thompson’s  $V$ .


1986 ◽  
Vol 20 (2) ◽  
pp. 241-243 ◽  
Author(s):  
S.V. Ovchinnikov

2010 ◽  
Vol 161 (2) ◽  
pp. 121-144 ◽  
Author(s):  
E. H. El Abdalaoui ◽  
M. Lemańczyk

2014 ◽  
Vol 17 (05) ◽  
pp. 1450020 ◽  
Author(s):  
MEHRDAD ASHTIANI ◽  
MOHAMMAD ABDOLLAHI AZGOMI

Trust models play an important role in computational environments. One of the main aims of the work undertaken in this domain is to provide a model that can better describe the socio-technical nature of computational trust. It has been recently shown that quantum-like formulations in the field of human decision making can better explain the underlying nature of these types of processes. Based on this research, the aim of this paper is to propose a novel model of trust based on quantum probabilities as the underlying mathematics of quantum theory. It will be shown that by using this new mathematical framework, we will have a powerful mechanism to model the contextuality property of trust. Also, it is hypothesized that many events or evaluations in the context of trust can be and should be considered as incompatible, which is unique to the noncommutative structure of quantum probabilities. The main contribution of this paper will be that, by using the quantum Bayesian inference mechanism for belief updating in the framework of quantum theory, we propose a biased trust inference mechanism. This mechanism allows us to model the negative and positive biases that a trustor may subjectively feel toward a certain trustee candidate. It is shown that by using this bias, we can model and describe the exploration versus exploitation problem in the context of trust decision making, recency effects for recently good or bad transactions, filtering pessimistic and optimistic recommendations that may result in good-mouthing or bad-mouthing attacks, the attitude of the trustor toward risk and uncertainty in different situations and the pseudo-transitivity property of trust. Finally, we have conducted several experimental evaluations in order to demonstrate the effectiveness of the proposed model in different scenarios.


Author(s):  
Yun-Shan Lee ◽  
Wen-Liang Hwang ◽  
Xiaolin Tian

The image registration problem involves determining a geometric transformation to properly align images of interest. This paper proposes a transformation approach called Continuous Piecewise Affine Transformation (CPAT) to model the geometric distortion in images. The associated design methodology for the 2D registration problem is also discussed. Registration on CPAT has two advantages: (1) The optimal transformation has a closed form analytical solution; and (2) the transformation is invertible and transitive. Because of these advantages, CPAT could be used for real-time registration and progressive registration, where the registration speed and transitivity property are important for the successful completion of the tasks. The results of experiments demonstrate the efficacy of CPAT in resolving the image registration problem.


2016 ◽  
Vol 66 (1) ◽  
pp. 91-101 ◽  
Author(s):  
Barbara Pȩkala ◽  
Urszula Bentkowska ◽  
Bernard De Baets

Abstract In this paper, a new relation for the set of interval-valued fuzzy relations is introduced. This relation is an interval order for the family of intervals and for the family of interval-valued fuzzy relations in a given set, it has the reflexivity property. Consequences of considering such a relation are studied in the context of operations on interval-valued fuzzy relations. A new transitivity property, namely possible T-transitivity is studied (pos-T-transitivity for short). This transitivity property is connected with the new relation proposed in this paper. Preservation of this type of transitivity by some operations is also discussed.


1970 ◽  
Vol 22 (6) ◽  
pp. 1133-1155 ◽  
Author(s):  
R. M. Raphael

In this paper we study algebraic closures for commutative semiprime rings. The main interest, however, is with rings which are regular in the sense of von Neumann. These play the same role with respect to semiprime rings as fields do with respect to integral domains. Two generally distinct notions are defined: “algebraic” and “weak-algebraic” extensions. Each has the transitivity property and yields a closure which is unique up to isomorphism and is “universal”. Both coincide in fields.The extensions here called “algebraic” were studied independently by Enochs [5] and myself. Our results on these extensions proceed from a different point of view, and allow us to answer a question posed by Enochs. Furthermore, these results are required (and were developed) in order to obtain the weak-algebraic closure, which was the original closure sought. The motivation for the weak-algebraic extensions is found in the work of Shoda [14, p. 134, no. 1].


Sign in / Sign up

Export Citation Format

Share Document