Results 51 to 60 of about 884 (194)

Closure operators and complete embeddings of residuated lattices [PDF]

open access: yes, 2003
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follows, including various types ...
Ono, Hiroakira
core   +1 more source

Collection frames for distributive substructural logics [PDF]

open access: yes, 2023
Funding: This research was supported by the Australian Research Council, Discovery Grant dp150103801.We present a new frame semantics for positive relevant and substructural propositional logics.
Restall, Greg, Standefer, Shawn
core   +1 more source

Substructural logic and partial correctness [PDF]

open access: yesACM Transactions on Computational Logic, 2003
We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models.
Dexter Kozen, Jerzy Tiuryn
openaire   +1 more source

A Van Benthem Characterization Result for Distribution-Free Logics

open access: yesLogics
This article contributes to recent results in the model theory of distribution-free logics (which include a Goldblatt-Thomason theorem and a development of their Sahlqvist theory) by lifting van Benthem’s characterization result for modal logic to the ...
Chrysafis Hartonas
doaj   +1 more source

A Substructural Modal Logic of Utility

open access: yesJournal of Logic and Computation, 2017
Abstract We introduce a substructural modal logic of utility that can be used to reason aboutoptimality with respect to properties of states. Our notion of state is quite general, and is able to represent resource allocation problems in distributed systems.
Pym, D, Anderson, G
openaire   +2 more sources

A substructural logic for layered graphs [PDF]

open access: yesJournal of Logic and Computation, 2014
Complex systems, be they natural or synthetic, are ubiquitous. In particular, complex networks of devices and services underpin most of society's operations. By their very nature, such systems are difficult to conceptualize and reason about effectively.
Collinson, M, McDonald, K, Pym, D
openaire   +2 more sources

Cis‐ and Trans‐Regulatory Factors Independently Shape Phenotypic Heterogeneity of Retinitis Pigmentosa

open access: yesAdvanced Science, EarlyView.
A zebrafish model carrying an identical human RHO S334X allele reveals two independent genetic layers shaping retinitis pigmentosa (RP) severity: a protective 3‐bp cis‐regulatory insertion that attenuates transgene expression, and a dominant trans‐acting modifier that restores a severe phenotype.
Cong Cui   +9 more
wiley   +1 more source

Leveraging Artificial Intelligence and Large Language Models for Cancer Immunotherapy

open access: yesAdvanced Science, EarlyView.
Cancer immunotherapy faces challenges in predicting treatment responses and understanding resistance mechanisms. Artificial intelligence (AI) and machine learning (ML) offer powerful solutions for cancer immunotherapy in patient stratification, biomarker discovery, treatment strategy optimization, and foundation model development.
Xinchao Wu   +4 more
wiley   +1 more source

Decoding Spatial Heterogeneity and Multi‐Omics Regulation with Hierarchical Graph Learning

open access: yesAdvanced Science, EarlyView.
ABSTRACT Recent advances in spatial multi‐omics technologies have enabled the simultaneous profiling of multiple molecular layers within the same tissue slice, providing unprecedented opportunities to investigate tissue spatial organization. However, most existing computational methods identify spatial domains in a purely data‐driven manner, rarely ...
Jiazhou Chen   +6 more
wiley   +1 more source

Complexity of Nonassociative Lambek Calculus with Classical and Intuitionistic Logic

open access: yesBulletin of the Section of Logic
The Nonassociative Lambek Calculus (NL) represents a logic devoid of the structural rules of exchange, weakening, and contraction, and it does not presume the associativity of its connectives. Its finitary consequence relation is decidable in polynomial
Paweł Płaczek
doaj   +1 more source

Home - About - Disclaimer - Privacy