Results 1 to 10 of about 900 (114)
A new proof of the generalized Hamiltonian–Real calculus [PDF]
Royal Society Open Science, 2016 The recently introduced generalized Hamiltonian–Real (GHR) calculus comprises, for the first time, the product and chain rules that makes it a powerful tool for quaternion-based optimization and adaptive signal processing.
Dongpo Xu, Hua Gao, Danilo P. Mandic
doaj +2 more sources
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems [PDF]
Logical Methods in Computer Science, 2011 Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining
Stéphane Jean Eric Lengrand +2 more
doaj +2 more sources
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
Qutrit Dichromatic Calculus and Its Universality [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce a dichromatic calculus (RG) for qutrit systems. We show that the decomposition of the qutrit Hadamard gate is non-unique and not derivable from the dichromatic calculus.
Quanlong Wang, Xiaoning Bian
doaj +1 more source
The Consistency and Complexity of Multiplicative Additive System Virtual [PDF]
Scientific Annals of Computer Science, 2015 This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV).
R. Horne
doaj +1 more source
Proof-relevant pi-calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and structural congruence.
Roly Perera, James Cheney
doaj +1 more source
A new coinductive confluence proof for infinitary lambda calculus [PDF]
Logical Methods in Computer Science, 2020 We present a new and formal coinductive proof of confluence and normalisation of B\"ohm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result.
Łukasz Czajka
doaj +1 more source
Contextual equivalence for higher-order pi-calculus revisited [PDF]
Logical Methods in Computer Science, 2005 The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence ...
Alan Jeffrey, Julian Rathke
doaj +1 more source
Fast Cut-Elimination using Proof Terms: An Empirical Study [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Gabriel Ebner
doaj +1 more source
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi [PDF]
Logical Methods in Computer Science, 2017 In this paper we give an arithmetical proof of the strong normalization of lambda-Sym-Prop of Berardi and Barbanera [1], which can be considered as a formulae-as-types translation of classical propositional logic in natural deduction style.
Peter Battyanyi, Karim Nour
doaj +1 more source