Results 61 to 70 of about 2,868 (293)

Logical Metainferentialism

open access: yesErgo, An Open Access Journal of Philosophy
Logical inferentialism is the view that the meaning of logical constants is implicitly defined by the operational rules that govern their behaviour in proofs—particularly in sequent calculus proofs, according to an increasingly dominant tendency.
Bogdan Dicher, Francesco Paoli
doaj   +2 more sources

2-Sequent calculus: a proof theory of modalities

open access: yes, 1992
Masini, A., 2-Sequent calculus: a proof theory of modalities, Annals of Pure and Applied Logic 58 (1992) 229–246.In this work we propose an extension of the Getzen sequent calculus in order to deal with modalities.
Masini, Andrea
core   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

A sequent calculus for relation algebras

open access: yesAnnals of Pure and Applied Logic, 1983
In this paper a new sequent calculus for the algebra of relations is presented. The new point of view consists in the restriction over the number of variables. So the nomenclature is justified: \(n\) sequent, \(n\) consistent, \(n\) proof, \(n\) model. The syntax and the semantics of the sequent calculus is naturally developed.
openaire   +1 more source

Structural insights into an engineered feruloyl esterase with improved MHET degrading properties

open access: yesFEBS Letters, EarlyView.
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa   +5 more
wiley   +1 more source

A sequent calculus for the Tamari order

open access: yesCoRR, 2017
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a semi-associative law (equivalently, tree rotation). We establish a focusing property for this sequent calculus (a strengthening
openaire   +2 more sources

The G4i Analogue of a G3i Sequent Calculus

open access: yesStudia Logica, 2022
AbstractThis paper provides a method to obtain terminating analytic calculi for a large class of intuitionistic modal logics. For a given logic with a cut-free calculus that is an extension of the method produces a terminating analytic calculus that is an extension of and equivalent to .
openaire   +2 more sources

Valosin‐containing protein counteracts ATP‐driven dissolution of FUS condensates through its ATPase activity in vitro

open access: yesFEBS Letters, EarlyView.
Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura   +2 more
wiley   +1 more source

Monadic translation of classical sequent calculus [PDF]

open access: yesMathematical Structures in Computer Science, 2013
We study monadic translations of the call-by-name (cbn) and call-by-value (cbv) fragments of the classical sequent calculus ${\overline{\lambda}\mu\tilde{\mu}}$ due to Curien and Herbelin, and give modular and syntactic proofs of strong normalisation. The target of the translations is a new meta-language for classical logic, named monadic λμ.
José Espírito Santo   +3 more
openaire   +4 more sources

Interaction and Depth against Nondeterminism in Proof Search [PDF]

open access: yesLogical Methods in Computer Science, 2014
Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions.
Ozan Kahramanogullari
doaj   +1 more source

Home - About - Disclaimer - Privacy