Results 21 to 30 of about 481 (175)
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
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
Theorems of Alternatives for Substructural Logics [PDF]
, 2021 A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative formulas in the R-mingle logic RM to the validity of a linear combination of these formulas, and Gordan's theorem ...
Nikolaos Galatos +2 more
openaire +3 more sources
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
Outline of a Dialogical Theory of Truth
Crítica, 2023 In this essay I propose two theories of truth and show how they deal with semantic paradoxes. Their most salient feature is that they are based on a gametheoretic understanding of logic and meaning.
Miguel Álvarez Lisboa
doaj +1 more source
Intuitionistic Layered Graph Logic: Semantics and Proof Theory [PDF]
Logical Methods in Computer Science, 2018 Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.
Simon Docherty, David Pym
doaj +1 more source
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +1 more source
Generalized quantification as substructural logic [PDF]
Journal of Symbolic Logic, 1996 AbstractWe show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables.
Alechina, N.A., van Lambalgen, M.
openaire +3 more sources