Curry's paradox incontractionless constructivelogic.Akama Seiki -1996 -Journal of Philosophical Logic 25 (2):135 - 150.detailsWe proposecontractionless constructivelogic which is obtained from Nelson's constructivelogic by deleting contractions. We discuss the consistency of a naive set theory based on the proposedlogic in relation to Curry's paradox. The philosophical significance ofcontractionless constructivelogic is also argued in comparison with Fitch's and Prawitz's systems.
On semilattice relevant logics.Ryo Kashima -2003 -Mathematical Logic Quarterly 49 (4):401.detailsThe semilattice relevant logics ∪R, ∪T, ∪RW, and ∪TW are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut-free labelled sequent calculus with plural succedents . We prove that these systems are equivalent, with respect to provable formulas, to the restricted systems with single succedents . Moreover, using this equivalence, we give a new Hilbert-style axiomatizations for ∪R and ∪T and prove equivalence between two semantics for (...) thecontractionless logics ∪RW and ∪TW. (shrink)
Intuitionistic propositionallogic without 'contraction' but with 'reductio'.J. M. Méndez &F. Salto -2000 -Studia Logica 66 (3):409-418.detailsRoutley- Meyer type relational complete semantics are constructed for intuitionisticcontractionlesslogic with reductio. Different negation completions of positive intuitionisticlogic without contraction are treated in a systematical, unified and semantically complete setting.
Some Metacomplete Relevant Modal Logics.Takahiro Seki -2013 -Studia Logica 101 (5):1115-1141.detailsAlogic is called metacomplete if formulas that are true in a certain preferred interpretation of thatlogic are theorems in its metalogic. In the area of relevant logics, metacompleteness is used to prove primeness, consistency, the admissibility of γ and so on. This paper discusses metacompleteness and its applications to a wider class of modal logics based oncontractionless relevant logics and their neighbours using Slaney’s metavaluational technique.
The basic constructivelogic for a weak sense of consistency.Gemma Robles &José M. Méndez -2008 -Journal of Logic, Language and Information 17 (1):89-107.detailsIn this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructivelogic BKc1 adequate to this sense of consistency in the ternary relational semantics without a set of designated points. Then we show how to define a series of logics extending BKc1 within the spectrum delimited bycontractionless minimal intuitionisticlogic. All logics defined in the paper are paraconsistent (...) logics. (shrink)
Extensions of the basic constructivelogic for weak consistency BKc1 defined with a falsity constant.Gemma Robles -2007 -Logic and Logical Philosophy 16 (4):311-322.detailsThelogic BKc1 is the basic constructivelogic for weak consistency in the ternary relational semantics without a set of designated points. In this paper, a number of extensions of B Kc1 defined with a propositional falsity constant are defined. It is also proved that weak consistency is not equivalent to negation-consistency or absolute consistency in anylogic included in positivecontractionless intermediatelogic LC plus the constructive negation of BKc1 and the contraposition axioms.
The basic constructivelogic for absolute consistency.José M. Méndez &Gemma Robles -2009 -Journal of Logic, Language and Information 18 (2):199-216.detailsIn this paper, consistency is understood as absolute consistency (i.e. non-triviality). The basic constructivelogic BKc6, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending BKc6 up tocontractionless intuitionisticlogic. All logics defined in this paper are paraconsistent logics.
Restricting the contraction axiom in Dummett's LC: a sublogic of LC with the Converse Ackermann Property, thelogic LCo.Francisco Salto,José M. Méndez &Gemma Robles -2001 -Bulletin of the Section of Logic 30 (3):139-146.detailsLCo with the Converse Ackermann Property is defined as the result of restricting Contraction in LC. Intuitionistic and Superintuitionistic Negation is shown to be compatible with the CAP.
Anderson And Belnap's Minimal PositiveLogic With Minimal Negation.J. Mendez,F. Salto &G. Robles -2002 -Reports on Mathematical Logic 36:117-130.detailsOur question is: can we embed minimal negation in implicative logics weaker than I→? Previous results show how to define minimal negation in the positive fragment of thelogic of relevance R and incontractionless intuitionisticlogic. Is it possible to endow weaker positive logics with minimal negation? This paper prooves that minimal negation can be embedded in even such a weak system as Anderson and Belnap’s minimal positivelogic.
Completeness and conservative extension results for some Boolean relevant logics.Steve Giambrone &Robert K. Meyer -1989 -Studia Logica 48 (1):1 - 14.detailsThis paper presents completeness and conservative extension results for the boolean extensions of the relevantlogic T of Ticket Entailment, and for thecontractionless relevant logics TW and RW. Some surprising results are shown for adding the sentential constant t to these boolean relevant logics; specifically, the boolean extensions with t are conservative of the boolean extensions without t, but not of the original logics with t. The special treatment required for the semantic normality of T is also (...) shown along the way. (shrink)
Entailment Generalized.Tore Fjetland Øgaard -2025 - In Andrew Tedder, Shawn Standefer & Igor Sedlar,New Directions in Relevant Logic. Springer. pp. 317-341.detailsTwo Hilbert calculi in the use-restricted relevance tradition of Anderson and Belnap are presented. One yields Anderson and Belnap's conjunctive version of the so-called ``entailment theorem,'' whereas the other yields the implication-iterated version. In contrast to previous such use-restricted calculi, those presented in this paper apply to arbitrary strengthenings of the weakcontractionlesslogic B without need for modifying the use-conditions. As such they help to identify the core idea of the ``use-account'' of relevance.
Export citation
Bookmark
A New Conditional for Naive Truth Theory.Andrew Bacon -2013 -Notre Dame Journal of Formal Logic 54 (1):87-104.detailsIn this paper alogic for reasoning disquotationally about truth is presented and shown to have a standard model. This work improves on Hartry Field's recent results establishing consistency and omega-consistency of truth-theories with strong conditional logics. A novel method utilising the Banach fixed point theorem for contracting functions on complete metric spaces is invoked, and the resultinglogic is shown to validate a number of principles which existing revision theoretic methods have heretofore failed to provide.
The undecidability of grisin's set theory.Andrea Cantini -2003 -Studia Logica 74 (3):345 - 368.detailsWe investigate acontractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.
Four relevant Gentzen systems.Steve Giambrone &Aleksandar Kron -1987 -Studia Logica 46 (1):55 - 71.detailsThis paper is a study of four subscripted Gentzen systems G u R +, G u T +, G u RW + and G u TW +. [16] shows that the first three are equivalent to the semilattice relevant logics u R +, u T + and u RW + and conjectures that G u TW + is, equivalent to u TW +. Here we prove Cut Theorems for these systems, and then show that modus ponens is admissible — which (...) is not so trivial as one normally expects. Finally, we give decision procedures for thecontractionless systems, G u TW + and G u RW +. (shrink)
Urquhart's C with Intuitionistic Negation: Dummett's LC without the Contraction Axiom.José M. Méndez &Francisco Salto -1995 -Notre Dame Journal of Formal Logic 36 (3):407-413.detailsThis paper offers a particular intuitionistic negation completion of Urquhart's system C resulting in a super-intuitionisticcontractionless propositionallogic equivalent to Dummett's LC without contraction.
Logic Matters.Logic Matters -unknowndetailsI 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)
No categories
InformalLogic referees 2011-2012.InformalLogic Editors -2013 -Informal Logic 33 (1):80.detailsThe Editors express their gratitude and appreciation to the indi-viduals listed below who served as referees for InformalLogic for Volumes 31 (2011) and 32 (2012).
Logic Programming: Proceedings of the Joint International Conference and Symposium onLogic Programming.Krzysztof R. Apt &Association forLogic Programming -1992 - MIT Press (MA).detailsThe Joint International Conference onLogic Programming, sponsored by the Association forLogic 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)
Computer ScienceLogic: 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers.M. Nielsen,Wolfgang Thomas &European Association for Computer ScienceLogic -1998 - Springer Verlag.detailsThis book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer ScienceLogic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer ScienceLogic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents (...) the state of the art in the area. (shrink)