scholarly journals A contribution to automated-oriented reasoning about permutability of sequent calculi rules

2013 ◽  
Vol 10 (3) ◽  
pp. 1185-1210 ◽  
Author(s):  
Tatjana Lutovac ◽  
James Harland
Keyword(s):  
Proof Theory ◽  
Sequent Calculus ◽  
Sufficient Conditions ◽  
General Treatment ◽  
Cut Elimination ◽  
Sequent Calculi ◽  
Special Cases ◽  
Necessary And Sufficient ◽  
Different Parts ◽  
Sequence Rules

Many important results in proof theory for sequent calculus (cut-elimination, completeness and other properties of search strategies, etc) are proved using permutations of sequent rules. The focus of this paper is on the development of systematic and automated-oriented techniques for the analysis of permutability in some sequent calculi. A representation of sequent calculi rules is discussed, which involves greater precision than previous approaches, and allows for correspondingly more precise and more general treatment of permutations. We define necessary and sufficient conditions for the permutation of sequence rules. These conditions are specified as constraints between the multisets that constitute different parts of the sequent rules. The authors extend their previous work in this direction to include some special cases of permutations.

Gentzen sequent calculi for some intuitionistic modal logics

2019 ◽  
Vol 27 (4) ◽  
pp. 596-623
Author(s):  
Zhe Lin ◽  
Minghui Ma
Keyword(s):  
Propositional Logic ◽  
Sequent Calculus ◽  
Modal Logics ◽  
Cut Elimination ◽  
Sequent Calculi ◽  
Intuitionistic Propositional Logic ◽  
Propositional Language ◽  
Intuitionistic Modal Logics ◽  
Subformula Property ◽  
Gentzen Sequent Calculus

Abstract Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\mathscr{L}}_\Diamond $ and $\mathscr{L}_{\Diamond ,\Box }$ which extend the intuitionistic propositional language with $\Diamond $ and $\Diamond ,\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.

scholarly journals Is there contextuality in behavioural and social systems?

2016 ◽  
Vol 374 (2058) ◽  
pp. 20150099 ◽  
Author(s):  
E. N. Dzhafarov ◽  
Ru Zhang ◽  
Janne Kujala
Keyword(s):  
Quantum Physics ◽  
Broad Class ◽  
Social Systems ◽  
Sufficient Conditions ◽  
Type Systems ◽  
Binary Outcomes ◽  
Special Cases ◽  
Einstein Podolsky Rosen ◽  
Cyclic Systems ◽  
Necessary And Sufficient

Most behavioural and social experiments aimed at revealing contextuality are confined to cyclic systems with binary outcomes. In quantum physics, this broad class of systems includes as special cases Klyachko–Can–Binicioglu–Shumovsky-type, Einstein–Podolsky–Rosen–Bell-type and Suppes–Zanotti–Leggett–Garg-type systems. The theory of contextuality known as contextuality-by-default allows one to define and measure contextuality in all such systems, even if there are context-dependent errors in measurements, or if something in the contexts directly interacts with the measurements. This makes the theory especially suitable for behavioural and social systems, where direct interactions of ‘everything with everything’ are ubiquitous. For cyclic systems with binary outcomes, the theory provides necessary and sufficient conditions for non-contextuality, and these conditions are known to be breached in certain quantum systems. We review several behavioural and social datasets (from polls of public opinion to visual illusions to conjoint choices to word combinations to psychophysical matching), and none of these data provides any evidence for contextuality. Our working hypothesis is that this may be a broadly applicable rule: behavioural and social systems are non-contextual, i.e. all ‘contextual effects’ in them result from the ubiquitous dependence of response distributions on the elements of contexts other than the ones to which the response is presumably or normatively directed.

scholarly journals Fractal Behavior of a Ternary 4-Point Rational Interpolation Subdivision Scheme

2018 ◽  
Vol 23 (4) ◽  
pp. 65 ◽  
Author(s):  
Kaijun Peng ◽  
Jieqing Tan ◽  
Zhiming Li ◽  
Li Zhang
Keyword(s):  
Singular Point ◽  
Sufficient Conditions ◽  
Rational Interpolation ◽  
Subdivision Scheme ◽  
Fractal Curve ◽  
Rational Scheme ◽  
Special Cases ◽  
Necessary And Sufficient ◽  
Parameter Values ◽  
Selection Of

In this paper, a ternary 4-point rational interpolation subdivision scheme is presented, and the necessary and sufficient conditions of the continuity are analyzed. The generalization incorporates existing schemes as special cases: Hassan–Ivrissimtzis’s scheme, Siddiqi–Rehan’s scheme, and Siddiqi–Ahmad’s scheme. Furthermore, the fractal behavior of the scheme is investigated and analyzed, and the range of the parameter of the fractal curve is the neighborhood of the singular point of the rational scheme. When the fractal curve and surface are reconstructed, it is convenient for the selection of parameter values.

Maximal and Minimal Ranks of the Common Solution of Some Linear Matrix Equations over an Arbitrary Division Ring with Applications

2009 ◽  
Vol 16 (02) ◽  
pp. 293-308 ◽  
Author(s):  
Qingwen Wang ◽  
Guangjing Song ◽  
Xin Liu
Keyword(s):  
Division Ring ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Linear Matrix ◽  
Matrix Equations ◽  
Common Solution ◽  
Special Cases ◽  
The Common ◽  
Necessary And Sufficient ◽  
Linear Matrix Equations

We establish the formulas of the maximal and minimal ranks of the common solution of certain linear matrix equations A1X = C1, XB2 = C2, A3XB3 = C3 and A4XB4 = C4 over an arbitrary division ring. Corresponding results in some special cases are given. As an application, necessary and sufficient conditions for the invariance of the rank of the common solution mentioned above are presented. Some previously known results can be regarded as special cases of our results.

scholarly journals Injectivity of linear combinations in $\mathcal{B}(\mathcal{H})$

2021 ◽  
Vol 37 ◽  
pp. 359-369
Author(s):  
Marko Kostadinov
Keyword(s):  
Linear Combination ◽  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Linear Combinations ◽  
Special Cases ◽  
Sufficient And Necessary Conditions ◽  
Alpha Beta ◽  
Necessary And Sufficient

The aim of this paper is to provide sufficient and necessary conditions under which the linear combination $\alpha A + \beta B$, for given operators $A,B \in {\cal B}({\cal H})$ and $\alpha, \beta \in \mathbb{C}\setminus \lbrace 0 \rbrace$, is injective. Using these results, necessary and sufficient conditions for left (right) invertibility are given. Some special cases will be studied as well.

The Projective Antecedent of the Three Reflection Theorem

1991 ◽  
Vol 34 (2) ◽  
pp. 265-274
Author(s):  
F. A. Sherk
Keyword(s):  
Projective Geometry ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Metric Geometry ◽  
Natural Question ◽  
Complete Answer ◽  
Special Cases ◽  
Reflection Theorem ◽  
Necessary And Sufficient

AbstractA complete answer is given to the question: Under what circumstances is the product of three harmonic homologies in PG(2, F) again a harmonic homology ? This is the natural question to ask in seeking a generalization to projective geometry of the Three Reflection Theorem of metric geometry. It is found that apart from two familiar special cases, and with one curious exception, the necessary and sufficient conditions on the harmonic homologies produce exactly the Three Reflection Theorem.

scholarly journals H-function with complex parameters I: existence

2001 ◽  
Vol 25 (9) ◽  
pp. 571-586
Author(s):  
Fadhel A. Al-Musallam ◽  
Vu Kim Tuan
Keyword(s):  
Sufficient Conditions ◽  
Integral Transforms ◽  
Necessary And Sufficient Conditions ◽  
Special Cases ◽  
Type Integral ◽  
Necessary And Sufficient

AnH-function with complex parameters is defined by a Mellin-Barnes type integral. Necessary and sufficient conditions under which the integral defining theH-function converges absolutely are established. Some properties, special cases, and an application to integral transforms are given.

THE QUASITRIANGULAR STRUCTURES FOR ω-SMASH COPRODUCT HOPF ALGEBRAS

2009 ◽  
Vol 08 (05) ◽  
pp. 673-687 ◽  
Author(s):  
ZHENGMING JIAO
Keyword(s):  
Hopf Algebras ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Special Cases ◽  
Necessary And Sufficient

In this paper, the quasitriangular structures of ω-smash coproduct Hopf algebras Bω ⋈ H as constructed by Caenepeel, Ion, Militaru and Zhu were studied. Necessary and sufficient conditions for ω-smash coproduct Hopf algebras to be quasitriangular Hopf algebras are given in terms of properties of their components. As applications of our results, some special cases are discussed. Especially, The quasitriangular structures for D(H)* and H4ω ⋈ kℤ2 are constructed.

scholarly journals Proof theory for quantified monotone modal logics

2019 ◽  
Vol 27 (4) ◽  
pp. 478-506
Author(s):  
Sara Negri ◽  
Eugenio Orlandelli
Keyword(s):  
Proof Theory ◽  
Modal Logics ◽  
Cut Elimination ◽  
Sequent Calculi ◽  
Completeness Proof ◽  
First Order ◽  
Constant Domains ◽  
Normal Modal Logics ◽  
Order Extension

Abstract This paper provides a proof-theoretic study of quantified non-normal modal logics (NNML). It introduces labelled sequent calculi based on neighbourhood semantics for the first-order extension, with both varying and constant domains, of monotone NNML, and studies the role of the Barcan formulas in these calculi. It will be shown that the calculi introduced have good structural properties: invertibility of the rules, height-preserving admissibility of weakening and contraction and syntactic cut elimination. It will also be shown that each of the calculi introduced is sound and complete with respect to the appropriate class of neighbourhood frames. In particular, the completeness proof constructs a formal derivation for derivable sequents and a countermodel for non-derivable ones, and gives a semantic proof of the admissibility of cut.

scholarly journals POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION

2010 ◽  
Vol 3 (3) ◽  
pp. 351-373 ◽  
Author(s):  
MEHRNOOSH SADRZADEH ◽  
ROY DYCKHOFF
Keyword(s):  
Modal Logic ◽  
Multiagent Systems ◽  
Epistemic Logic ◽  
Proof Theory ◽  
Sequent Calculus ◽  
Dynamic Epistemic Logic ◽  
Algebraic Semantics ◽  
Sequent Calculi ◽  
Closure Operators ◽  
Positive Logic

We consider a simple modal logic whose nonmodal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4, and S5, such logics are useful, as shown in previous work by Baltag, Coecke, and the first author, for encoding and reasoning about information and misinformation in multiagent systems. For the propositional-only fragment of such a dynamic epistemic logic, we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of “nested” or “tree-sequent” calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario.

Sign in / Sign up

Export Citation Format

Share Document