Compact Bilinear Logic , introduced by Lambek [14], arises from the multiplicative fragment of Noncommutative Linear Logic of Abrusci [1] by identifying times with par and 0 with 1. In this paper, we present two sequent systems for CBL and prove the cut-elimination theorem for them. We also discuss a connection between cut-elimination for CBL and the Switching Lemma from [14].

Grishin algebras are a generalisation of Boolean algebras that provide algebraic models for classical bilinear logic with two mutually cancelling negation connectives. We show how to build complete Grishin algebras as algebras of certain subsets (“propositions”) of cover systems that use an orthogonality relation to interpret the negations. The variety of Grishin algebras is shown to be closed under MacNeille completion, and this is applied to embed an arbitrary Grishin algebra into the algebra of all propositions of some (...) cover system, by a map that preserves all existing joins and meets. This representation is then used to give a cover system semantics for a version of classical bilinear logic that has first-order quantifiers and infinitary conjunctions and disjunctions. (shrink)

Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided sequent system for this logic. Here we prove an analogous result for the nonassociative version of this logic. Like Lambek, we consider a left-sided system, but the result also holds for its right-sided version, by a natural symmetry. The treatment of nonassociative sequent systems involves some subtleties, not appearing in associative logics. We also prove the PTime complexity of (...) the multiplicative fragment of NBL. (shrink)

Grammar can be formulated as a kind of substructural propositional logic. In support of this claim, we survey bare Gentzen style deductive systems and two kinds of non-commutative linear logic: intuitionistic and compact bilinear logic. We also glance at their categorical refinements.

NEMO means Network Mobility which is the extension of Mipv6 and it is invented for accessing internet for the group of people when they are travelling in Vehicle as Network group. During handoff while exchanging Binding Updates between the Mobile Network Node, Correspondent Node and Home Agent, many security threats are present during those messages exchange. It may prone to several standard malicious attacks on the BU and Binding Acknowledgement. An efficient end-to-end security method is required to protect the BU (...) Exchange between MNN, HA and CN. In this paper, a secure architecture is proposed to provide authentication and confidentiality at each level of communication using a 3-Party Key Exchange called 3-PKE-NEMO with the help of Bilinear Pairing Theorem. Handoff delay is reduced without compromising security strength. The whole experimentation of this proposed work is carried out using NS2 simulation tool and authentication proof is given using BAN logic between all the nodes in NEMO. The proposed security architecture is compared with related existing solutions and found to be more secure. (shrink)

It is possible to define a combinatorial closure on alternating bilinear maps with few relations similar to that in [2]. For the ℵ 0 - categorical case we show that this closure is part of the algebraic closure.

We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid.

In this paper we study the algebraic structure ofω-stable bilinear maps, arbitrary rings, and nilpotent groups. We will also provide rather complete structure theorems for the above structures in the finite Morley rank case.

Linear Logic is a versatile framework with diverse applications in computer science and mathematics. One intriguing fragment of Linear Logic is Multiplicative-Additive Linear Logic (MALL), which forms the exponential-free component of the larger framework. Modifying MALL, researchers have explored weaker logics such as Noncommutative MALL (Bilinear Logic, BL) and Cyclic MALL (CyMALL) to investigate variations in commutativity. In this paper, we focus on Cyclic Nonassociative Bilinear Logic (CyNBL), a variant that combines noncommutativity and (...) nonassociativity. We introduce a sequent system for CyNBL, which includes an auxiliary system for incorporating nonlogical axioms. Notably, we establish the cut elimination property for CyNBL. Moreover, we establish the strong conservativeness of CyNBL over Full Nonassociative Lambek Calculus (FNL) without additive constants. The paper highlights that all proofs are constructed using syntactic methods, ensuring their constructive nature. We provide insights into constructing cut-free proofs and establishing a logical relationship between CyNBL and FNL. (shrink)

Kleene’s strong three-valued logic extends naturally to a four-valued logic proposed by Belnap. We introduce a guard connective into Belnap’s logic and consider a few of its properties. Then we show that by using it four-valued analogs of Kleene’s weak three-valued logic, and the asymmetric logic of Lisp are also available. We propose an extension of these ideas to the family of distributive bilattices. Finally we show that for bilinear bilattices the extensions do not (...) produce any new equivalences. (shrink)

In this paper we consider the relations existing between four deductive systems that have been called categorial grammars and have relevant connections with linguistic investigations: the syntactic calculus, bilinear logic, compact bilinear logic and Curry''s semantic calculus.

Is Einstein's metric theory of gravitation to be quantized to yield a complete and logically consistent picture of the geometry of the real world in the presence of quantized material sources? To answer this question, we give arguments that there is a consistent way to extend general relativity to small distances by incorporating further geometric quantities at the level of the connection into the theory and introducing corresponding field equations for their determination, allowing thereby the metric and the Levi-Civita connection (...) to remain classical quantities. The dualism between matter and geometry is extended to quantized fields with the help of a Hibert bundle ℋ raised over a Riemann-Cartan spacetime. Quantized subnuclear matter fields (generalized quantum mechanical wave functions) are sections on ℋ which determine generalized bilinear currents acting as sourc currents for the bundle geometry at small distances. The established dualism between matter and the underlying bundle geometry contains general relativity as a classical part. (shrink)

On the basis of previous studies in relational biology and the phenomenological calculus, in my contribution I outline the mathematical foundations of biological perception generally, and visual perception specifically. In this approach, the premise is that objects in nature are not directly accessible, and that real manifestations are projections of these invariant objects. The morphology of observables is mathematically entailed by the duality of projections and projectors in a bilinear algebra that is the phenomenological calculus. The relationships between what (...) is not directly accessible (which can be defined as noumena) and phenomena may be explicated in terms of metabolism and repair, whence a geometric theory of the perceived, the visible in particular, may be formulated in the category-theoretic language of relational biology. (shrink)

The Editors express their gratitude and appreciation to the indi-viduals listed below who served as referees for Informal Logic for Volumes 31 (2011) and 32 (2012).

We argue that the extant evidence for Stoic logic provides all the elements required for a variable-free theory of multiple generality, including a number of remarkably modern features that straddle logic and semantics, such as the understanding of one- and two-place predicates as functions, the canonical formulation of universals as quantified conditionals, a straightforward relation between elements of propositional and first-order logic, and the roles of anaphora and rigid order in the regimented sentences that express multiply general (...) propositions. We consider and reinterpret some ancient texts that have been neglected in the context of Stoic universal and existential propositions and offer new explanations of some puzzling features in Stoic logic. Our results confirm that Stoic logic surpasses Aristotle’s with regard to multiple generality, and are a reminder that focusing on multiple generality through the lens of Frege-inspired variable-binding quantifier theory may hamper our understanding and appreciation of pre-Fregean theories of multiple generality. (shrink)

I read Stefan Collini’s What are Universities For? last week with very mixed feelings. In the past, I’ve much admired his polemical essays on the REF, “impact”, the Browne Report, etc. in the London Review of Books and elsewhere: they speak to my heart. If you don’t know those essays, you can get some of their flavour from his latest article in the Guardian yesterday. But I found the book a disappointment. Perhaps the trouble is that Collini is too decent, (...) too high-minded, has too unrealistically exalted a view about what actually happens in universities which is too coloured by attitudes appropriate to the traditional humanities. And he is optimistic to the point of fantasy if he thinks that people are so susceptible to “the romance of ideas and the power of beauty” that they will want, or can be brought to want, lots and lots of universities in order to promote the ideas (as if they would suppose that the task of “conserving, understanding, extending and handing on to subsequent generations the intellectual, scientific, and artistic heritage of mankind” was clearly ill-served when there were only forty universities in England, as opposed to a hundred and whatever). (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense (...) reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found (...) in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

In their recent article “A Hierarchy of Classical and Paraconsistent Logics”, Eduardo Barrio, Federico Pailos and Damien Szmuc present novel and striking results about meta-inferential validity in various three valued logics. In the process, they have thrown open the door to a hitherto unrecognized domain of non-classical logics with surprising intrinsic properties, as well as subtle and interesting relations to various familiar logics, including classical logic. One such result is that, for each natural number n, there is a (...) class='Hi'>logic which agrees with classical logic on tautologies, inferences, meta-inferences, meta-meta-inferences, meta-meta-...-meta-inferences, but that disagrees with classical logic on n + 1-meta-inferences. They suggest that this shows that classical logic can only be characterized by defining its valid inferences at all orders. In this article, I invoke some simple symmetric generalizations of BPS’s results to show that the problem is worse than they suggest, since in fact there are logics that agree with classical logic on inferential validity to all orders but still intuitively differ from it. I then discuss the relevance of these results for truth theory and the classification problem. (shrink)

This book revives the study of conventional implicatures in natural language semantics. H. Paul Grice first defined the concept. Since then his definition has seen much use and many redefinitions, but it has never enjoyed a stable place in linguistic theory. Christopher Potts returns to the original and uses it as a key into two presently under-studied areas of natural language: supplements and expressives. The account of both depends on a theory in which sentence meanings can be multidimensional. The theory (...) is logically and intuitively compositional, and it minimally extends a familiar kind of intensional logic, thereby providing an adaptable, highly useful tool for semantic analysis. The result is a linguistic theory that is accessible not only to linguists of all stripes, but also philosophers of language, logicians, and computer scientists who have linguistic applications in mind. (shrink)

Kant's views on logic and logical theory play an important role in his critical writings, especially the Critique of Pure Reason. However, since he published only one short essay on the subject, we must turn to the texts derived from his logic lectures to understand his views. The present volume includes three previously untranslated transcripts of Kant's logic lectures: the Blumberg Logic from the 1770s; the Vienna Logic (supplemented by the recently discovered Hechsel Logic) (...) from the early 1780s; and the Dohna-Wundlacken Logic from the early 1790s. Also included is a new translation of the Jasche Logic, compiled at Kant's request and published in 1800 but which also appears to stem in part from a transcript of his lectures. Together these texts provide a rich source of evidence for Kant's evolving views on logic, on the relations between logic and other disciplines, and on a variety of topics (e.g. analysis and synthesis) central to Kant's mature philosophy. They also provide a portrait of Kant as lecturer, a role in which he was both popular and influential. This volume contains substantial editorial apparatus: a general introduction, linguistic and factual notes, glossaries of key terms (both German/English and English/German) and concordances relating Kant's lectures to Georg Frederich Meier's Excerpts from the Doctrine of Reason, the book on which Kant lectured throughout his life and in which he left extensive notes. (shrink)