scholarly journals A Syntactic Characterization of the Gabbay-de Jongh Logics

10.29007/1mcd ◽  
2018 ◽  
Author(s):  
Jeroen Goudsmit
Keyword(s):  
Propositional Logic ◽  
Sufficient Conditions ◽  
Intuitionistic Propositional Logic ◽  
Admissible Rules ◽  
Intermediate Logics ◽  
Refutation Systems ◽  
Refutation System

Skura syntactically characterised intuitionistic propositional logic among all intermediate logics by means of a Łukasiewicz-style refutation system. Another such syntactic characterisation is given by Iemhoff in terms of admissible rules. Here we offer a bridge between these results. That is to say, we provide sufficient conditions under which admissible rules yield a refutation system fully characterising the logic. In particular, we give a characterisation of the Gabbay–de Jongh logics by means of refutation systems employing ideas from admissibility.

scholarly journals A Characterization of the Intuitionistic Propositional Logic

1970 ◽  
Vol 37 ◽  
pp. 131-136
Author(s):  
Nobol Muti
Keyword(s):  
Propositional Logic ◽  
Short Note ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Intuitionistic Propositional Logic ◽  
Necessary And Sufficient

In this short note, is shown a necessary and sufficient condition for a logic to be an intermediate propositional logic in Umezawa’s sense (see the reference), under such an assumption that any logic in consideration (as a subclass of LK-provable propositions) contains at least the axioms of the positive propositional logic LPS (Curry’s LA) as its axioms and is closed with respect to the rules of detachment and substitution.

AGGREGATION AND IDEMPOTENCE

2013 ◽  
Vol 6 (4) ◽  
pp. 680-708 ◽  
Author(s):  
LLOYD HUMBERSTONE
Keyword(s):  
Propositional Logic ◽  
Consequence Relations ◽  
Classical Propositional Logic ◽  
Intuitionistic Propositional Logic ◽  
Sentential Context ◽  
Consequence Relation ◽  
Intermediate Logics ◽  
Conservative Operation ◽  
The One

AbstractA 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context. All 1-ary contexts are aggregative according to the consequence relation of classical propositional logic (though not, for example, according to the consequence relation of intuitionistic propositional logic), and here we explore the extent of this phenomenon, generalized to having arbitrary connectives playing the role of conjunction; among intermediate logics, LC, shows itself to occupy a crucial position in this regard, and to suggest a characterization, applicable to a broader range of consequence relations, in terms of a variant of the notion of idempotence we shall call componentiality. This is an analogue, for the consequence relations of propositional logic, of the notion of a conservative operation in universal algebra.

scholarly journals On the admissible rules of intuitionistic propositional logic

2001 ◽  
Vol 66 (1) ◽  
pp. 281-294 ◽  
Author(s):  
Rosalie Iemhoff
Keyword(s):  
Propositional Logic ◽  
Proof System ◽  
Intuitionistic Propositional Logic ◽  
Admissible Rules

AbstractWe present a basis for the admissible rules of intuitionistic propositional logic. Thereby a conjecture by de Jongh and Visser is proved. We also present a proof system for the admissible rules, and give semantic criteria for admissibility.

scholarly journals On a New Geometric Constant Related to the Euler-Lagrange Type Identity in Banach Spaces

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 116
Author(s):  
Qi Liu ◽  
Yongjin Li
Keyword(s):  
Banach Spaces ◽  
Product Space ◽  
Sufficient Conditions ◽  
Normal Structure ◽  
The Other ◽  
Inner Product ◽  
Equivalent Characterization ◽  
Geometric Constant ◽  
Geometric Constants

In this paper, we will introduce a new geometric constant LYJ(λ,μ,X) based on an equivalent characterization of inner product space, which was proposed by Moslehian and Rassias. We first discuss some equivalent forms of the proposed constant. Next, a characterization of uniformly non-square is given. Moreover, some sufficient conditions which imply weak normal structure are presented. Finally, we obtain some relationship between the other well-known geometric constants and LYJ(λ,μ,X). Also, this new coefficient is computed for X being concrete space.

scholarly journals On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes

2020 ◽  
Vol 15 (1) ◽  
pp. 258-265
Author(s):  
Yu Zhou ◽  
Daoguang Mu ◽  
Xinfeng Dong
Keyword(s):  
Sufficient Conditions ◽  
Sum Of Squares ◽  
Basic Component ◽  
Necessary And Sufficient Conditions ◽  
Autocorrelation Functions ◽  
Walsh Spectrum ◽  
Cryptographic Algorithms ◽  
Necessary And Sufficient ◽  
Relationship Of

AbstractS-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms. In this paper we give the distributions of Walsh spectrum and the distributions of autocorrelation functions for (n + 1)-bit S-boxes in [12]. We obtain the nonlinearity of (n + 1)-bit S-boxes, and one necessary and sufficient conditions of (n + 1)-bit S-boxes satisfying m-order resilient. Meanwhile, we also give one characterization of (n + 1)-bit S-boxes satisfying t-order propagation criterion. Finally, we give one relationship of the sum-of-squares indicators between an n-bit S-box S0 and the (n + 1)-bit S-box S (which is constructed by S0).

Central automorphisms of free nilpotent Lie algebras

2017 ◽  
Vol 16 (11) ◽  
pp. 1750205
Author(s):  
Özge Öztekin ◽  
Naime Ekici
Keyword(s):  
Lie Algebras ◽  
Finite Rank ◽  
Characteristic Zero ◽  
Sufficient Conditions ◽  
Nilpotency Class ◽  
Nilpotent Lie Algebra ◽  
Central Automorphism ◽  
Nilpotent Lie Algebras ◽  
Central Automorphisms

Let [Formula: see text] be the free nilpotent Lie algebra of finite rank [Formula: see text] [Formula: see text] and nilpotency class [Formula: see text] over a field of characteristic zero. We give a characterization of central automorphisms of [Formula: see text] and we find sufficient conditions for an automorphism of [Formula: see text] to be a central automorphism.

Sign in / Sign up

Export Citation Format

Share Document