اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe BF Calculus and the Square Root of Negation
72
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The concept of imaginary logical values was introduced by Spencer-Brown in Laws of Form, in analogy to the square root of -1 in the complex numbers. In this paper, we develop a new approach to representing imaginary values. The resulting system, which we call BF, is a four-valued generalization of Laws of Form. Imaginary values in BF act as cyclic four-valued operators. The central characteristic of BF is its capacity to portray imaginary values as both values and as operators. We show that the BF algebra is a stronger, axiomatically complete extension to Laws of Form capable of representing other four-valued systems, including the Kauffman/Varela Waveform Algebra and Belnaps Four-Valued Bilattice. We conclude by showing a representation of imaginary values based on the Artin braid group, a representation of the braid group and a braided representation of the quaternions in this form.
قيم البحث
اقرأ أيضاً
Let Q_0 denote the rational numbers expanded to a meadow by totalizing inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s that extracts the sign of a rational number. In this paper we discuss an extension Q_0(s ,sqrt) of the
signed rationals in which every number has a unique square root.
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting. In order t
o address more subtle linguistic issues, the Lambek calculus has been extended in various ways. In particular, Morrill and Valentin (2015) introduce an extension with so-called exponential and bracket modalities. Their extension is based on a non-standard contraction rule for the exponential that interacts with the bracket structure in an intricate way. The standard contraction rule is not admissible in this calculus. In this paper we prove undecidability of the derivability problem in their calculus. We also investigate restricted decidable fragments considered by Morrill and Valentin and we show that these fragments belong to the NP class.
Let $R$ be a finite ring and define the hyperbola $H={(x,y) in R times R: xy=1 }$. Suppose that for a sequence of finite odd order rings of size tending to infinity, the following square root law bound holds with a constant $C>0$ for all non-trivial
characters $chi$ on $R^2$: [ left| sum_{(x,y)in H}chi(x,y)right|leq Csqrt{|H|}. ] Then, with a finite number of exceptions, those rings are fields. For rings of even order we show that there are other infinite families given by Boolean rings and Boolean twists which satisfy this square-root law behavior. We classify the extremal rings, those for which the left hand side of the expression above satisfies the worst possible estimate. We also describe applications of our results to problems in graph theory and geometric combinatorics. These results provide a quantitative connection between the square root law in number theory, Salem sets, Kloosterman sums, geometric combinatorics, and the arithmetic structure of the underlying rings.
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural interpretation, we prese
nt two lines of calculi. The first one is a fragment of infinitary action logic and includes an omega-rule for introducing iteration to the antecedent. We also consider a version with infinite (but finitely branching) derivations and prove equivalence of these t
We consider the Lambek calculus, or non-commutative multiplicative intuitionistic linear logic, extended with iteration, or Kleene star, axiomatised by means of an $omega$-rule, and prove that the derivability problem in this calculus is $Pi_1^0$-har
d. This solves a problem left open by Buszkowski (2007), who obtained the same complexity bound for infinitary action logic, which additionally includes additive conjunction and disjunction. As a by-product, we prove that any context-free language without the empty word can be generated by a Lambek grammar with unique type assignment, without Lambeks non-emptiness restriction imposed (cf. Safiullin 2007).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
