Results 11 to 20 of about 255 (160)
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
Basic Core Fuzzy Logics and Algebraic Routley–Meyer-Style Semantics
Axioms, 2021 Recently, algebraic Routley–Meyer-style semantics was introduced for basic substructural logics. This paper extends it to fuzzy logics. First, we recall the basic substructural core fuzzy logic MIAL (Mianorm logic) and its axiomatic extensions, together ...
Eunsuk Yang
doaj +1 more source
Análisis Filosófico, 2021 In this paper, I present two presumed alternative definitions of metavalidity for metainferences: Local and Global. I defend the latter, first, by arguing that it is not too weak with respect to metainference-cases, and that local metavalidity is in fact
Paula Teijeiro
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
Why a Logic is not only its Set of Valid Inferences
Análisis Filosófico, 2021 The main idea that we want to defend in this paper is that the question of what a logic is should be addressed differently when structural properties enter the game.
Eduardo A. Barrio, Federico Pailos
doaj +1 more source
LNL-FPC: The Linear/Non-linear Fixpoint Calculus [PDF]
Logical Methods in Computer Science, 2021 We describe a type system with mixed linear and non-linear recursive types called LNL-FPC (the linear/non-linear fixpoint calculus). The type system supports linear typing, which enhances the safety properties of programs, but also supports non-linear ...
Bert Lindenhovius +2 more
doaj +1 more source
Kleene Algebras, Regular Languages and Substructural Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce the two substructural propositional logics KL, KL+ , which use disjunction, fusion and a unary, (quasi-)exponential connective. For both we prove strong completeness with respect to the interpretation in Kleene algebras and a variant thereof.
Christian Wurm
doaj +1 more source
Structural Rules in Natural Deduction with Alternatives
Bulletin of the Section of Logic, 2023 Natural deduction with alternatives extends Gentzen–Prawitz-style natural deduction with a single structural addition: negatively signed assumptions, called alternatives.
Greg Restall
doaj +1 more source
Substructure Temporal Logic [PDF]
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013 In formal verification and design, reasoning about substructures is a crucial aspect for several fundamental problems, whose solution often requires to select a portion of the model of interest on which to verify a specific property. In this paper, we present a new branching-time temporal logic, called Substructure Temporal Logic (STL, for short ...
BENERECETTI, MASSIMO +2 more
openaire +2 more sources
CONNEXIVE IMPLICATIONS IN SUBSTRUCTURAL LOGICS
The Review of Symbolic Logic, 2023 AbstractThis paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FL ${}_{\scriptsize\mbox{e}}$ -algebras).
Davide Fazio, Gavin St. John
openaire +2 more sources