Results 31 to 40 of about 5,869 (280)

Some recent advances on the method of moments in kinetic theory [PDF]

ESAIM: Proceedings and Surveys, 2023
This review presents some recent works on the construction of closure relations for moment systems extracted from a kinetic equation. A rough construction of those closures and the main properties of the resulting systems are described. Especially, based
Pichard Teddy
doaj   +1 more source

Typed realizability for first-order classical analysis [PDF]

Logical Methods in Computer Science, 2015
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus.
Valentin Blot
doaj   +1 more source

The Sierpinski Object in the Scott Realizability Topos [PDF]

Logical Methods in Computer Science, 2020
We study the Sierpinski object $\Sigma$ in the realizability topos based on Scott's graph model of the $\lambda$-calculus. Our starting observation is that the object of realizers in this topos is the exponential $\Sigma ^N$, where $N$ is the natural ...
Tom de Jong, Jaap van Oosten
doaj   +1 more source

A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus [PDF]

Logical Methods in Computer Science, 2017
We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.
Thomas Streicher
doaj   +1 more source

From Timed Interpreted Systems to Split-Step Timed Interpreted Systems: Making Delivery Delay Explicit and Deciding Realizability in Security Protocol Verification

IEEE Access
Timed security protocols accept a freshness token only if it is still valid when the message that carries it is delivered, not when it is sent. Verification models that merge sending and delivery into one event erase the transit interval in which a token
Agnieszka M. Zbrzezny
doaj   +1 more source

Game semantics for first-order logic [PDF]

Logical Methods in Computer Science, 2010
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj   +1 more source

Randomising Realizability

, 2021
We consider a randomised version of Kleene’s realizability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability.
Merlin Carl, Carl, M., Galeotti, L., Lorenzo Galeotti, Passmann, R., Robert Passmann   +5 more
core   +1 more source

Labor Activity Specificities and Value-Meaning Outline of Living Space [PDF]

Ученые записки Казанского университета: Серия Гуманитарные науки, 2016
The paper is devoted to the research of the living space specificity in people that depends on the type of their (mental/physical) labor activity. On the basis of the sample of 96 people aged from 40 to 50 years (48 men and 48 women), we compared the ...
N.R. Salikhova
doaj  

Turbulence and Rossby Wave Dynamics with Realizable Eddy Damped Markovian Anisotropic Closure

Fluids
The theoretical basis for the Eddy Damped Markovian Anisotropic Closure (EDMAC) is formulated for two-dimensional anisotropic turbulence interacting with Rossby waves in the presence of advection by a large-scale mean flow.
Jorgen S. Frederiksen, Terence J. O’Kane   +1 more
doaj   +1 more source

Realizability of Graphs [PDF]

Discrete & Computational Geometry, 2007
A graph is d-realizable if, for every configuration of its vertices in EN, there exists a another corresponding configuration in Ed with the same edge lengths. A graph is 2-realizable if and only if it is a partial 2-tree, i.e., a subgraph of the 2-sum of triangles in the sense of graph theory.
Maria Belk, Robert Connelly
openaire   +2 more sources