LUW Sept 20, 2023 - On Consequence and Rejection as Operators by Alexei Muravitsky

10 views

Skip to first unread message

jean-yves beziau

unread,

Sep 19, 2023, 9:57:36 AM9/19/23

to Lista acadêmica brasileira dos profissionais e estudantes da área de LOGICA

The next session of the Logica Universalis Webinar will be Wednesday 20 at 4pm CET

Speaker: Alexei Muravitsky Northwestern State University, Natchitoches, USA

Title: On Consequence and Rejection as Operators

Abstract: This paper is devoted to the concepts of consequence and rejection, formulated as operators on a nonempty set of sentences, which may initially be unstructured. One of the issues that we pay attention to is the “cyclicity” of these concepts when they are defined one through the other. In addition, we explore this cyclicity, when the set of all sentences acquires some structure, or we can assume some structure of sentences in the sense that the operation of substitution can be applied to them.

https://link.springer.com/article/10.1007/s11787-023-00334-y

Presentation of the special issue or Logica Universalis on Rejection

editors Alexei Muravitsky and Alex Citkin

Workshop at the 7th World Congress and School on Universal Logic

100 Years of Refutation in Logic

https://sites.google.com/view/unilog-2022/7th-congress/workshops/100-years-of-refutation

Chair: Ioannis Vandoulakis

Vice-President of LUA (Logica Universalis Organization)

http://www.logica-universalis.org/LUAD

Everyone is welcome to attend, register here:

https://cassyni.com/s/logica-universalis/seminars/

Jean-Yves Beziau

Editor-in-Chief Logica Universalis

Organizer of the Logica Universalis Webinar

jean-yves beziau

unread,

Oct 2, 2023, 11:18:42 AM10/2/23

to Lista acadêmica brasileira dos profissionais e estudantes da área de LOGICA

The next session of the Logica Universalis Webinar will be Wednesday October 4 at 4pm CET

Speaker: Gabriele Pulcini, University of Rome Tor Vergata, Italy

Title: Complementary Proof Nets for Classical Logic

Abstract: A complementary system for a given logic is a proof system whose theorems are exactly the formulas that are not valid according to the logic in question. This article is a contribution to the complementary proof theory of classical propositional logic. In particular, we present a complementary proof-net system, CPN, that is sound and complete with respect to the set of all classically invalid (one-side) sequents. We also show that cut elimination in CPN enjoys strong normalization along with strong confluence (and, hence, uniqueness of normal forms).

https://link.springer.com/article/10.1007/s11787-023-00337-9