Results 81 to 90 of about 355 (190)
Topological Theory and Analytical Configuration for a Universal Community Model
, 2013 The study in this paper is on the fundamental topological processes remaining at the background of any kind of problem. The any kind of problem here is explanable by corresponding it with question, illness, and/or wellness concepts even if they are ...
Sengor, Taner
core +1 more source
Integrative Reduction, Confirmation, and the Syntax-Semantics Map [PDF]
, 2011 Different pairs of scientific theories stand in different relations. The present paper identifies a new type of intertheoretic relation, Integrative Reduction, that is instantiated in the relation between linguistic syntax and semantics.
Hartmann, Stephan, Liefke, Kristina
core
A sequent calculus with dependent types for classical arithmetic
, 2018 International audienceIn a recent paper, Herbelin developed a calculus dPA$^\omega$ in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a ...
Miquey, Étienne, Étienne Miquey
core +1 more source
Advances in modeling the pressure correlation terms in the second moment equations
, 1991 In developing turbulence models, various model constraints were proposed in an attempt to make the model equations more general (or universal). The most recent of these are the realizability principle, the linearity principle, the rapid distortion theory,
Shih, Tsan-Hsing +2 more
core
, 1999 The notion of `tripos' was motivated by the desire to explain in what sense Higg's description of sheaf toposes as H-valued sets and Hyland's realizability toposes are instances of the same construction. The construction itself can be seen
Andrew M. Pitts, Pitts, Andrew M.
core +1 more source
n次元レイノルズ応力テンソルの Realizability の一般証明
This paper presents mathematically rigorous and universal proof of realizability conditions which, Schumann insists, any Reynolds stress component must satisfy.
清水, 昭比古 +5 more
core
Antichains and compositional algorithms for LTL synthesis
, 2011 In this paper, we present new monolithic and compositional algorithms to solve the LTL realizability problem. Those new algorithms are based on a reduction of the LTL realizability problem to a game whose winning condition is defined by a universal ...
Naiyong Jin +5 more
core +1 more source
Decidability and universality in symbolic dynamical systems
, 2006 Many different definitions of computational universality for various types of dynamical systems have flourished since Turing’s work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems ...
Blondel, Vincent +2 more
core
Assembly theory explains and quantifies selection and evolution. [PDF]
Nature, 2023 Sharma A +5 more
europepmc +1 more source
Embeddability of pseudoline arrangements and point configurations to Eucliean plane
, 1999 The present thesis explores embeddability (realizability) properties of pseudoline arrangements, perhaps, the most important mathematical structures in computational geometry.
Javid Huseynov, Huseynov, Javid
core