ON ANALYTICITY IN DEEP INFERENCE PAOLA BRUSCOLI AND ALESSIO GUGLIELMI In this note, we discuss the notion of analytic inference rule for propositional logics in the calculus of structures (CoSCoS generalises the s

Source URL: cs.bath.ac.uk

28 JuneNon-commutativity and MELL in the Calculus of Structures Alessio Guglielmi and Lutz Straßburger Technische Universit¨

Source URL: www.ki.inf.tu-dresden.de

Resolution in the Calculus of Structures

Source URL: cs.bath.ac.uk

RDP 2015, Jun. 30, 2015, WCMCS, Warsaw. From syntax to semantics of Dependent Type Theories - Formalized by Vladimir Voevodsky

Source URL: rdp15.mimuw.edu.pl

• Mathematics
• Academia
• Mathematical logic
• Type theory
• Abstract algebra
• Logic in computer science
• Mathematical structures
• Formal methods
• Intuitionistic type theory
• Expression
• Lambda calculus
• Universal algebra

A On the Power of Substitution in the Calculus of Structures Novak Novakovi´c, Inria Lutz Straßburger, Inria There are two contributions in this paper. First, we give a direct proof of the known fact that Frege system

Source URL: www.lix.polytechnique.fr

• Logic
• Mathematical logic
• Propositional calculus
• Proof theory
• Automated theorem proving
• Logical truth
• Boolean algebra
• Frege system
• Substitution
• Natural deduction
• Hilbert system
• Sequent

The Focused Calculus of Structures Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger INRIA & LIX/École Polytechnique Route de Saclay, 91128 Palaiseau, France {kaustuv,nguenot,lutz}@lix.polytechnique.fr

Source URL: www.lix.polytechnique.fr

• Logic
• Proof theory
• Mathematical logic
• Sequent
• Linear logic
• Cut-elimination theorem
• Noncommutative logic
• Rule of inference
• Soundness
• Natural deduction
• CurryHoward correspondence

Low-Rank Tensors for Scoring Dependency Structures Tao Lei, Yu Xin, Yuan Zhang, Regina Barzilay, and Tommi Jaakkola Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology {taolei, y

Source URL: people.csail.mit.edu

• Algebra
• Mathematics
• Binary operations
• Vector calculus
• Tensors
• Tensor
• Euclidean vector
• Parsing
• Cross product
• Word embedding

Optimized Reasoning in Description Logics using Hypertableaux Boris Motik, Rob Shearer, and Ian Horrocks University of Manchester, UK Abstract. We present a novel reasoning calculus for Description Logics

Source URL: www.hermit-reasoner.com

• Mathematics
• Algebraic structures
• Transitive closure
• Ring

Reducts of structures and maximal-closed permutation groups Manuel Bodirsky∗, Laboratoire d’Informatique (LIX), CNRS UMR 7161, Ecole Polytechnique, 91128 Palaiseau, France,

Source URL: www1.maths.leeds.ac.uk

• Group theory
• Lie groups
• Non-associative algebras
• Lie algebras
• Constructible universe
• Equivalence relation
• Model theory
• Mutation
• Order
• Group action
• Vertex operator algebra
• Lambda calculus

SciFe: Scala Framework for Efficient Enumeration of Data Structures with Invariants

Source URL: lampwww.epfl.ch

• Software engineering
• Computer programming
• Computing
• Search algorithms
• Data types
• Type theory
• Enumerated type
• Lambda calculus
• Scala
• Foreach loop
• Combinatory logic
• Comparison of C Sharp and Java