اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA General Verification for Functional Completeness by Abstract Operators
59
0
0.0
(
0
)
تأليف
Yang Tian
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An operator set is functionally incomplete if it can not represent the full set $lbrace eg,vee,wedge,rightarrow,leftrightarrowrbrace$. The verification for the functional incompleteness highly relies on constructive proofs. The judgement with a large untested operator set can be inefficient. Given with a mass of potential operators proposed in various logic systems, a general verification method for their functional completeness is demanded. This paper offers an universal verification for the functional completeness. Firstly, we propose two abstract operators $widehat{R}$ and $breve{R}$, both of which have no fixed form and are only defined by several weak constraints. Specially, $widehat{R}_{geq}$ and $breve{R}_{geq}$ are the abstract operators defined with the total order relation $geq$. Then, we prove that any operator set $mathfrak{R}$ is functionally complete if and only if it can represent the composite operator $widehat{R}_{geq}circbreve{R}_{geq}$ or $breve{R}_{geq}circwidehat{R}_{geq}$. Otherwise $mathfrak{R}$ is determined to be functionally incomplete. This theory can be generally applied to any untested operator set to determine whether it is functionally complete.
قيم البحث
اقرأ أيضاً
Existing work on theorem proving for the assertion language of separation logic (SL) either focuses on abstract semantics which are not readily available in most applications of program verification, or on concrete models for which completeness is no
t possible. An important element in concrete SL is the points-to predicate which denotes a singleton heap. SL with the points-to predicate has been shown to be non-recursively enumerable. In this paper, we develop a first-order SL, called FOASL, with an abstracted version of the points-to predicate. We prove that FOASL is sound and complete with respect to an abstract semantics, of which the standard SL semantics is an instance. We also show that some reasoning principles involving the points-to predicate can be approximated as FOASL theories, thus allowing our logic to be used for reasoning about concrete program verification problems. We give some example theories that are sound with respect to different variants of separation logics from the literature, including those that are incompatible with Reynoldss semantics. In the experiment we demonstrate our FOASL based theorem prover which is able to handle a large fragment of separation logic with heap semantics as well as non-standard semantics.
An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and $n$-divisibility of action
s. We consider the general question of when there are realizations of abstract systems of congruences satisfying various measurability constraints. We completely characterize which abstract systems of congruences can be realized by nonmeager Baire measurable pieces of the sphere under the action of rotations on the $2$-sphere. This answers a question of Wagon. We also construct Borel realizations of abstract systems of congruences for the action of $mathsf{PSL}_2(mathbb{Z})$ on $mathsf{P}^1(mathbb{R})$. The combinatorial underpinnings of our proof are certain types of decomposition of Borel graphs into paths. We also use these decompositions to obtain some results about measurable unfriendly colorings.
An equational axiomatisation of probability functions for one-dimensional event spaces in the language of signed meadows is expanded with conditional values. Conditional values constitute a so-called signed vector meadow. In the presence of a probabi
lity function, equational axioms are provided for expected value, variance, covariance, and correlation squared, each defined for conditional values. Finite support summation is introduced as a binding operator on meadows which simplifies formulating requirements on probability mass functions with finite support. Conditional values are related to probability mass functions and to random variables. The definitions are reconsidered in a finite dimensional setting.
The logics RL, RP, and RG have been obtained by expanding Lukasiewicz logic L, product logic P, and Godel--Dummett logic G with rational constants. We study the lattices of extensions and structural completeness of these three expansions, obtaining r
esults that stand in contrast to the known situation in L, P, and G. Namely, RL is hereditarily structurally complete. RP is algebraized by the variety of rational product algebras that we show to be Q-universal. We provide a base of admissible rules in RP, show their decidability, and characterize passive structural completeness for extensions of RP. Furthermore, structural completeness, hereditary structural completeness, and active structural completeness coincide for extensions of RP, and this is also the case for extensions of RG, where in turn passive structural completeness is characterized by the equivalent algebraic semantics having the joint embedding property. For nontrivial axiomatic extensions of RG we provide a base of admissible rules. We leave the problem open whether the variety of rational Godel algebras is Q-universal.
We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the logic is compl
ete; in addition, has the finite model property, and again ADF. This argument can be iterated, and as an application we obtain the finite model property for PDL-like expansions of logics that ADF.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
