Results 21 to 30 of about 27,177 (320)
Loop-free verification of termination of derivation for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2008 A fragment of a deterministic propositional dynamic logic (DPDL, in short) is considered The language of considered fragment contains propositional symbols, action constants, action operator (repetition) and logical symbols.
Regimantas Pliuškevičius
doaj +1 more source
Command injection attacks, continuations, and the Lambek calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 This paper shows connections between command injection attacks, continuations, and the Lambek calculus: certain command injections, such as the tautology attack on SQL, are shown to be a form of control effect that can be typed using the Lambek calculus,
Hayo Thielecke
doaj +1 more source
Lukasiewicz logic and Riesz spaces [PDF]
, 2013 We initiate a deep study of {\em Riesz MV-algebras} which are MV-algebras endowed with a scalar multiplication with scalars from $[0,1]$. Extending Mundici's equivalence between MV-algebras and $\ell$-groups, we prove that Riesz MV-algebras are ...
Di Nola, Antonio, Leustean, Ioana
core +1 more source
Encoding many-valued logic in {\lambda}-calculus
, 2020 We extend the well-known Church encoding of two-valued Boolean Logic in $\lambda$-calculus to encodings of $n$-valued propositional logic (for $3\leq n\leq 5$) in well-chosen infinitary extensions in $\lambda$-calculus.
de Vries, Fer-Jan
core +1 more source
A Neighbourhood Semantics for the Logic TK
Principia: An International Journal of Epistemology, 2011 The logic TK was introduced as a propositional logic extending the classical propositional calculus with a new unary operator which interprets some conceptions of Tarski’s consequence operator. TK-algebras were introduced as models to TK.
Hércules de Araújo Feitosa +1 more
doaj +3 more sources
An Alternative Natural Deduction for the Intuitionistic Propositional Logic [PDF]
, 2016 A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus ...
Ilić, Mirjana
core +1 more source
Two loop detection mechanisms: a comparison [PDF]
, 1997 In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ Hist, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in
D. Sahlin, J.-Y. Girard, R. Dyckhoff
core +4 more sources
Characterisation of Strongly Normalising lambda-mu-Terms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types.
Steffen van Bakel +2 more
doaj +1 more source
Axioms, 2023 Residuated basic logic (RBL) is the logic of residuated basic algebras, which constitutes a conservative extension of basic propositional logic (BPL). The basic implication is a residual of a non-associative binary operator in RBL.
Zhe Lin, Minghui Ma
doaj +1 more source
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic.
Luís Pinto, Tarmo Uustalu
doaj +1 more source