Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"Substructural logics"”.
-
Decidability for Residuated Lattices and Substructural Logics
… of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of substructural logics by simple structural rules, with the aim of classifying simple equations by the …
-
Logical constants
… of logic are basic and that alternative logics (later called substructural logics) differ from each other only in their structural assumptions, and not in their assumptions about logical constants.
-
Subexponentials in Nonassociative Lambek Calculus
… on a family on noncommutative nonassociative substructural logics enriched with subexponentials, unary modalities licensing local application of structural rules. Primarily, we prove upper and lower bounds on complexity of provability in a broad class of these logics. To uniformly frame these …
-
On Galois correspondences in formal logic
… in order to develop a model theory over substructural logics which is capable of expressing this Galois correspondence. A formal semantics is developed for quantified predicate substructural logics based on algebraic models for their propositional or nonquantified fragments. This …
-
Three Essays on Substructural Approaches to Semantic Paradoxes
This thesis consists of three papers on substructural approaches to semantic paradoxes. The first paper introduces a formal system, based on a nontransitive substructural logic, which has exactly the valid and antivalid inferences of classical logic at every level of (meta)inference, but which I …
-
The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL
… were later shown to form algebraic models for substructural logics. The latter are non-classical logics that include intuitionistic, relevance, many-valued, and linear logic, among others. Most of the important examples of substructural logics are obtained by adding structural rules to the …
-
Reasoning Using Higher-Order Abstract Syntax in a Higher-Order Logic Proof Environment: Improvements to Hybrid and a Case Study
… work on Hybrid, with various specification logics (SLs), including substructural logics, formalized in Isabelle/HOL and used in turn to encode judgments of the object language. We also compare these with a variant that does not use an intermediate SL layer. In the course of the case study, …
-
Formalização da lógica linear em Coq
… Linear Logic (LL) is one of the most significant substructural logics and the cut rule is admissible in its sequent calculus. LL is a refinement of the classical and the intuitionistic model. As a resource sensible logic, LL has been widely used in the specification and verification of computer …
-
Substructurality and residuation in logic and algebra
… for Classical and Intuitionistic Propositional Logics. And the rules he gave in both cases can be grouped in different categories: because of its character, the Cut rule deserves a special category for itself; then we have the rules of introduction and elimination of each one of the connectives, …
-
Permission in Non-Monotonic Normative Reasoning
… between several existing non-normal modal logics, which share the idea of rational obligation as weakest permission. It provided several translation results regarding their deductive power, and pointed out the theoretical significance of this particular relationship between permission and …
-
Algebraic semantics and calculi for Nelson's logics
The aim of this thesis is to study a family of logics, comprised of Nelson’s logic S, constructive logic with strong negation N 3, quasi-Nelson logic QN and quasi-Nelson implicative logic QN I. This is done in two ways. The first is by means of an axiomatisation via a Hilbert Calculus and the …
-
Pełny niełączny rachunek Lambeka z modalnościami i jego zastosowania w gramatykach typów
Rozprawa jest poświęcona pełnemu niełącznemu rachunkowi Lambeka wzbogaconemu o różne modalności. Te systemy tworzą pewną rodzinę logik substrukturalnych. W rozprawie badamy rachunki NL (niełączny rachunek Lambeka), DFNL (pełny niełączny rachunek Lambeka z prawami dystrybutywności dla operacji …