نتایج جستجو برای: intuitionistic logic

تعداد نتایج: 154469  

2007
Carlos Caleiro Jaime Ramos

We present a simple logic that combines, in a conservative way, the implicative fragments of both classical and intuitionistic logics, thus settling a problem posed by Dov Gabbay in [5]. We also show that the logic can be given a nice complete axiomatization by adding four simple mixed axioms to the usual axiomatizations of classical and intuitionistic implications.

2010
Jean-Marie Madiot

Intersection types characterize properties on lambda-terms such as head, weak and strong normalization. One can establish relations between intuitionistic logic and intersection types with idempotence. Here we consider a type system without idempotence and we underline common traits with intuitionistic multiplicative linear logic. We analyse head normalization to try and get properties such as ...

Journal: :Annals of Pure and Applied Logic 2007

Journal: :Notre Dame Journal of Formal Logic 2020

Journal: :The Australasian Journal of Logic 2010

Journal: :Journal of Logic and Computation 1992

2016
Christoph Benzmüller Jens Otten Walter Carnielli Aniello Murano

This paper introduces a non-clausal connection calculus for intuitionistic first-order logic. It is an extension of the non-clausal connection calculus for classical logic by prefixes and an additional prefix unification, which encode the Kripke semantics of intuitionistic logic. nanoCoP-i is a first implementation of this intuitionistic non-clausal connection calculus. Details of the compact P...

2016
Simon Docherty David Pym

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic that gives an account of layering. As in bunched systems, the logic includes the usual intuitionistic connectives, together with a non-commutative, non-associative con...

Journal: :CoRR 2014
Maxime Amblard Christian Retoré

This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic — which involves both commutative and non commutative connectives. This calculus first introduced by de Groote and as opposed to the classical version by Abrusci and Ruet admits a full entropy which allow order to be relaxed into any suborder. Our result also incl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید