ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION

2017 ◽  
Vol 23 (2) ◽  
pp. 181-200 ◽  
Author(s):  
DAVIDE RINALDI ◽  
PETER SCHUSTER ◽  
DANIEL WESSEL
Keyword(s):  
Mathematical Structures ◽  
Proof Analysis ◽  
Entailment Relations ◽  
Conservation Theorem ◽  
Formal Topology ◽  
Dynamical Algebra

AbstractCompleteness and other forms of Zorn’s Lemma are sometimes invoked for semantic proofs of conservation in relatively elementary mathematical contexts in which the corresponding syntactical conservation would suffice. We now show how a fairly general syntactical conservation theorem that covers plenty of the semantic approaches follows from an utmost versatile criterion for conservation given by Scott in 1974.To this end we work with multi-conclusion entailment relations as extending single-conclusion entailment relations. In a nutshell, the additional axioms with disjunctions in positive position can be eliminated by reducing them to the corresponding disjunction elimination rules, which in turn prove admissible in all known mathematical instances. In deduction terms this means to fold up branchings of proof trees by way of properties of the relevant mathematical structures.Applications include the syntactical counterparts of the theorems or lemmas known under the names of Artin–Schreier, Krull–Lindenbaum, and Szpilrajn. Related work has been done before on individual instances, e.g., in locale theory, dynamical algebra, formal topology and proof analysis.

scholarly journals The Topological Origin of Quantum Randomness

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 581
Author(s):  
Stefan Heusler ◽  
Paul Schlummer ◽  
Malte S. Ubben
Keyword(s):  
High School ◽  
Hilbert Space ◽  
Group Theory ◽  
Lorentz Group ◽  
Quantum Physics ◽  
Time Development ◽  
Mathematical Structures ◽  
Stochastic Nature ◽  
Quantum Randomness ◽  
And Topology

What is the origin of quantum randomness? Why does the deterministic, unitary time development in Hilbert space (the ‘4π-realm’) lead to a probabilistic behaviour of observables in space-time (the ‘2π-realm’)? We propose a simple topological model for quantum randomness. Following Kauffmann, we elaborate the mathematical structures that follow from a distinction(A,B) using group theory and topology. Crucially, the 2:1-mapping from SL(2,C) to the Lorentz group SO(3,1) turns out to be responsible for the stochastic nature of observables in quantum physics, as this 2:1-mapping breaks down during interactions. Entanglement leads to a change of topology, such that a distinction between A and B becomes impossible. In this sense, entanglement is the counterpart of a distinction (A,B). While the mathematical formalism involved in our argument based on virtual Dehn twists and torus splitting is non-trivial, the resulting haptic model is so simple that we think it might be suitable for undergraduate courses and maybe even for High school classes.

Optimum criterion for lightweight nonlinear confusion component with multi-criteria decision making

2021 ◽  
pp. 1-12
Author(s):  
Nabilah Abughazalah ◽  
Majid Khan ◽  
Noor Munir ◽  
Amna Zafar
Keyword(s):  
Decision Making ◽  
Multi Criteria Decision Making ◽  
Ideal Solution ◽  
Mathematical Structures ◽  
Substitution Boxes

In this article, we have designed a new scheme for the construction of the nonlinear confusion component. Our mechanism uses the notion of a semigroup, Inverse LA-semigroup, and various other loops. With the help of these mathematical structures, we can easily build our confusion component namely substitution boxes (S-boxes) without having specialized structures. We authenticate our proposed methodology by incorporating the available cryptographic benchmarks. Moreover, we have utilized the technique for order of preference by similarity to ideal solution (TOPSIS) to select the best nonlinear confusion component. With the aid of this multi-criteria decision-making (MCDM), one can easily select the best possible confusion component while selecting among various available nonlinear confusion components.

Minimal invariant spaces in formal topology

1997 ◽  
Vol 62 (3) ◽  
pp. 689-698 ◽  
Author(s):  
Thierry Coquand
Keyword(s):  
Direct Consequence ◽  
Arithmetical Progression ◽  
Standard Result ◽  
Continuous Map ◽  
Compact Topological Space ◽  
Combinatorial Theorem ◽  
Minimal Property ◽  
Special Instance ◽  
Invariant Spaces ◽  
Formal Topology

A standard result in topological dynamics is the existence of minimal subsystem. It is a direct consequence of Zorn's lemma: given a compact topological space X with a map f: X→X, the set of compact non empty subspaces K of X such that f(K) ⊆ K ordered by inclusion is inductive, and hence has minimal elements. It is natural to ask for a point-free (or formal) formulation of this statement. In a previous work [3], we gave such a formulation for a quite special instance of this statement, which is used in proving a purely combinatorial theorem (van de Waerden's theorem on arithmetical progression).In this paper, we extend our analysis to the case where X is a boolean space, that is compact totally disconnected. In such a case, we give a point-free formulation of the existence of a minimal subspace for any continuous map f: X→X. We show that such minimal subspaces can be described as points of a suitable formal topology, and the “existence” of such points become the problem of the consistency of the theory describing a generic point of this space. We show the consistency of this theory by building effectively and algebraically a topological model. As an application, we get a new, purely algebraic proof, of the minimal property of [3]. We show then in detail how this property can be used to give a proof of (a special case of) van der Waerden's theorem on arithmetical progression, that is “similar in structure” to the topological proof [6, 8], but which uses a simple algebraic remark (Proposition 1) instead of Zorn's lemma. A last section tries to place this work in a wider context, as a reformulation of Hilbert's method of introduction/elimination of ideal elements.

scholarly journals Preface

2011 ◽  
Vol 21 (4) ◽  
pp. 671-677 ◽  
Author(s):  
GÉRARD HUET
Keyword(s):  
Mathematical Logic ◽  
Computer Science ◽  
20Th Century ◽  
Theorem Proving ◽  
Propositional Calculus ◽  
Interactive Theorem Proving ◽  
Predicate Calculus ◽  
Special Issue ◽  
Mathematical Structures ◽  
Infinite Domains

This special issue of Mathematical Structures in Computer Science is devoted to the theme of ‘Interactive theorem proving and the formalisation of mathematics’.The formalisation of mathematics started at the turn of the 20th century when mathematical logic emerged from the work of Frege and his contemporaries with the invention of the formal notation for mathematical statements called predicate calculus. This notation allowed the formulation of abstract general statements over possibly infinite domains in a uniform way, and thus went well beyond propositional calculus, which goes back to Aristotle and only allowed tautologies over unquantified statements.

Proof-analysis and Continuity

2006 ◽  
Vol 11 (1-2) ◽  
pp. 121-155 ◽  
Author(s):  
Michael Otte
Keyword(s):  
Proof Analysis

Exploring Representation Theory of Unitary Groups via Linear Optical Passive Devices

2006 ◽  
Vol 13 (04) ◽  
pp. 415-426 ◽  
Author(s):  
P. Aniello ◽  
C. Lupo ◽  
M. Napolitano
Keyword(s):  
Lie Algebras ◽  
Fock Space ◽  
Fixed Number ◽  
Unitary Groups ◽  
Space Representation ◽  
Remarkable Case ◽  
Mathematical Structures ◽  
Passive Devices ◽  
Optical Modes ◽  
Linear Optical

In this paper, we investigate some mathematical structures underlying the physics of linear optical passive (LOP) devices. We show, in particular, that with the class of LOP transformations on N optical modes one can associate a unitary representation of U (N) in the N-mode Fock space, representation which can be decomposed into irreducible sub-representations living in the subspaces characterized by a fixed number of photons. These (sub-)representations can be classified using the theory of representations of semi-simple Lie algebras. The remarkable case where N = 3 is studied in detail.

Sign in / Sign up

Export Citation Format

Share Document