scholarly journals Cut elimination for knowledge logic with interaction

2021 ◽  
Vol 47 ◽  
Author(s):  
Julius Andrikonis ◽  
Regimantas Pliuškevičius

In the article the multimodal logic Tn with central agent interaction axiom is analysed. The Hilbert type calculi is presented, then Gentzen type calculi with cut is derived and the proof of cutelimination theorem is outlined. The work shows that it is possible to construct a Gentzen type calculi without cut for this logic.

2008 ◽  
Vol 48 ◽  
Author(s):  
Julius Andrikonis

In the article, multimodal logics K4n and S4n with the central agent axiom are analysed. The Hilbert type calculi are presented, then the Gentzen type calculi with cut are derived, and the proofs of thecut-eliminationtheorems are outlined. The work shows that it is possible to construct an analytical Gentzen type calculi for these logics.


1999 ◽  
Vol 64 (2) ◽  
pp. 685-700 ◽  
Author(s):  
Mamoru Kaneko

AbstractWe show the faithful embedding of common knowledge logic CKL into game logic GL, that is, CKL is embedded into GL and GL is a conservative extension of the fragment obtained by this embedding. Then many results in GL are available in CKL, and vice versa. For example, an epistemic consideration of Nash equilibrium for a game with pure strategies in GL is carried over to CKL. Another important application is to obtain a Gentzen-style sequent calculus formulation of CKL and its cut-elimination. The faithful embedding theorem is proved for the KD4–type propositional CKL and GL, but it holds for some variants of them.


2021 ◽  
Author(s):  
Arnon Avron

Abstract The logic $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ was introduced in Robles and Mendéz (2014, Logic Journal of the IGPL, 22, 515–538) as a paraconsistent logic which is based on Gödel’s 3-valued matrix, except that Kleene–Łukasiewicz’s negation is added to the language and is used as the main negation connective. We show that $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ is exactly the intersection of $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ and $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$, the two truth-preserving 3-valued logics which are based on the same truth tables. (In $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ the set ${\cal D}$ of designated elements is $\{1\}$, while in $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$  ${\cal D}=\{1,0.5\}$.) We then construct a Hilbert-type system which has (MP) for $\to $ as its sole rule of inference, and is strongly sound and complete for $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$. Then we show how, by adding one axiom (in the case of $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$) or one new rule of inference (in the case of $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$), we get strongly sound and complete systems for $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ and $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$. Finally, we provide quasi-canonical Gentzen-type systems which are sound and complete for those logics and show that they are all analytic, by proving the cut-elimination theorem for them.


Author(s):  
Michael P. DeJonge

With this chapter, the book transitions from a presentation of Bonhoeffer’s political thinking to an account of his resistance thinking in action. This chapter also begins the presentation of the first of the three phases of resistance, which lasts from 1932 until 1935. The chapter focuses on “The Church and the Jewish Question” (1933), the central text of this first phase, identifying in it the first two of Bonhoeffer’s six types of resistance: individual and humanitarian resistance to state injustice (type 1) and the church’s resistance through diaconal service to the victims of state injustice (type 2). These set the stage for Chapters 6–8’s considerations of resistance through the church’s preaching office, which is the central agent of resistance in the first phase.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Jason Hindes ◽  
Victoria Edwards ◽  
Klimka Szwaykowska Kasraie ◽  
George Stantchev ◽  
Ira B. Schwartz

AbstractUnderstanding swarm pattern formation is of great interest because it occurs naturally in many physical and biological systems, and has artificial applications in robotics. In both natural and engineered swarms, agent communication is typically local and sparse. This is because, over a limited sensing or communication range, the number of interactions an agent has is much smaller than the total possible number. A central question for self-organizing swarms interacting through sparse networks is whether or not collective motion states can emerge where all agents have coherent and stable dynamics. In this work we introduce the phenomenon of swarm shedding in which weakly-connected agents are ejected from stable milling patterns in self-propelled swarming networks with finite-range interactions. We show that swarm shedding can be localized around a few agents, or delocalized, and entail a simultaneous ejection of all agents in a network. Despite the complexity of milling motion in complex networks, we successfully build mean-field theory that accurately predicts both milling state dynamics and shedding transitions. The latter are described in terms of saddle-node bifurcations that depend on the range of communication, the inter-agent interaction strength, and the network topology.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Bing He ◽  
Yong Hong ◽  
Zhen Li

AbstractFor the Hilbert type multiple integral inequality $$ \int _{\mathbb{R}_{+}^{n}} \int _{\mathbb{R}_{+}^{m}} K\bigl( \Vert x \Vert _{m,\rho }, \Vert y \Vert _{n, \rho }\bigr) f(x)g(y) \,\mathrm{d} x \,\mathrm{d} y \leq M \Vert f \Vert _{p, \alpha } \Vert g \Vert _{q, \beta } $$ ∫ R + n ∫ R + m K ( ∥ x ∥ m , ρ , ∥ y ∥ n , ρ ) f ( x ) g ( y ) d x d y ≤ M ∥ f ∥ p , α ∥ g ∥ q , β with a nonhomogeneous kernel $K(\|x\|_{m, \rho }, \|y\|_{n, \rho })=G(\|x\|^{\lambda _{1}}_{m, \rho }/ \|y\|^{\lambda _{2}}_{n, \rho })$ K ( ∥ x ∥ m , ρ , ∥ y ∥ n , ρ ) = G ( ∥ x ∥ m , ρ λ 1 / ∥ y ∥ n , ρ λ 2 ) ($\lambda _{1}\lambda _{2}> 0$ λ 1 λ 2 > 0 ), in this paper, by using the weight function method, necessary and sufficient conditions that parameters p, q, $\lambda _{1}$ λ 1 , $\lambda _{2}$ λ 2 , α, β, m, and n should satisfy to make the inequality hold for some constant M are established, and the expression formula of the best constant factor is also obtained. Finally, their applications in operator boundedness and operator norm are also considered, and the norms of several integral operators are discussed.


Sign in / Sign up

Export Citation Format

Share Document