Results 91 to 100 of about 699,995 (283)
Models of Type Theory Based on Moore Paths [PDF]
Logical Methods in Computer Science, 2019 This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path.
Ian Orton, Andrew M. Pitts
doaj +1 more source
A Neural Network Implementation for Free Energy Principle [PDF]
arXiv, 2023 The free energy principle (FEP), as an encompassing framework and a unified brain theory, has been widely applied to account for various problems in fields such as cognitive science, neuroscience, social interaction, and hermeneutics. As a computational model deeply rooted in math and statistics, FEP posits an optimization problem based on variational ...
arxiv
Exhaustible sets in higher-type computation [PDF]
Logical Methods in Computer Science, 2008 We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predicate ...
Martin Escardo
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Certain frontotemporal lobar degeneration subtypes, including TDP‐A and B, can either occur sporadically or in association with specific genetic mutations. It is uncertain whether syndromic or imaging features previously associated with these patient groups are subtype or genotype specific.
Sean Coulborn +17 more
wiley +1 more source
Quick appraisal of "Sistema de suministro desde el embalse del Cenajo a la Mancomunidad de Canales del Taibilla" [PDF]
, 2013 The project under assessment concerns the construction of an aqueduct in order to divert water from Tajo-Segura Channel onto the Cenajo reservoir and to the water purification plants of Sierra de la Espada and of Campotéjar.
COWI +1 more
core
On the strength of proof-irrelevant type theories [PDF]
Logical Methods in Computer Science, 2008 We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover.
Benjamin Werner
doaj +1 more source
arXiv, 2009 This paper studies convex sets categorically, namely as algebras of a distribution monad. It is shown that convex sets occur in two dual adjunctions, namely one with preframes via the Boolean truth values {0,1} as dualising object, and one with effect algebras via the (real) unit interval [0,1] as dualising object. These effect algebras are of interest
arxiv
Phase 1, First‐In‐Human, Single‐/Multiple‐Ascending Dose Study of Iluzanebart in Healthy Volunteers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To evaluate the safety, tolerability, pharmacokinetics, and pharmacodynamics of iluzanebart, a fully human monoclonal antibody TREM2 (triggering receptor expressed on myeloid cells 2) agonist, after single‐ (SAD) and multiple‐ascending‐dose (MAD) administration.
Andreas Meier +8 more
wiley +1 more source
Petri Net Reachability Graphs: Decidability Status of First Order Properties [PDF]
Logical Methods in Computer Science, 2012 We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal languages without labels on transitions or atomic propositions on markings.
Philippe Darondeau +3 more
doaj +1 more source
Complexity of correctness for pomset logic proof nets [PDF]
arXiv, 2019 We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
arxiv