Results 111 to 120 of about 14,747,589 (248)
A coalgebraic approach to Kleene algebra with tests
, 2004 Kleene algebra with tests is an extension of Kleene algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene algebra with tests, along the lines of the coalgebraic theory of ...
Chen, Hubie, Pucella, R.
core +3 more sources
Neutrino Oscillation in a Minimal Length Spacetime
Astronomische Nachrichten, EarlyView.ABSTRACT We investigate how neutrino oscillations are modified in a non‐commutative spacetime characterized by a minimal length scale, described by the Quesne–Tkachuk algebra. By incorporating the algebra's deformation parameter β$$ \beta $$ into the effective neutrino mass, we derive the two‐flavor oscillation probability in this non‐commutative ...
Luísa Nadal‐Camargo +3 more
wiley +1 more source
The structure of logical consequence : proof-theoretic conceptions [PDF]
, 2010 The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage ...
Hjortland, Ole T.
core +2 more sources
Polynomial time algorithm for checking strong equivalence of program
Труды Института системного программирования РАН, 2018 Strong (logic&term) equivalence of programs is the weakest decidable equivalence relation which approximates the functional equivalence of programs.
V. A. Zakharov, T. A. Novikova
doaj
British Educational Research Journal, EarlyView.Abstract This paper presents an exploratory analysis of contemporary curricular and professional qualification policies in the Scottish education system, focusing on minimum qualification thresholds for mathematics teaching. The study examines how veteran secondary mathematics practitioners perceive the structural and pedagogical implications of using ...
Paul Argyle McDonald
wiley +1 more source
Algebraic Structures in Set-Theoretic Yang-Baxter and Reflection Equations
We present resent results regarding invertible, non-degenerate solutions of the set-theoretic Yang-Baxter and reflection equations. We recall the notion of braces and we present and prove various fundamental properties required for the solutions of the ...
Doikou, Anastasia; id_orcid
core +1 more source
Choice principles in Węglorz’ models [PDF]
, 1997 Węglorz' models are models for set theory without the axiom of choice. Each one is determined by an atomic Boolean algebra. Here the algebraic properties of the Boolean algebra are compared to the set theoretic properties of the ...
Brunner, N., Rubin, Jean, Howard, Paul
core
Automated Data‐Efficient Symbolic Regression for Interpretable Bioprocess Model Development
Biotechnology and Bioengineering, EarlyView.ABSTRACT Bioprocessing is central to the sustainable manufacture of pharmaceuticals, food products, and renewable chemicals. Consequently, developing high‐fidelity kinetic models to facilitate accurate process prediction, optimisation, and scale‐up is a top research priority.
Luca Riezzo +3 more
wiley +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study systematizes the literature on eco‐innovation and economic complexity, aiming to understand how the sophistication of productive structures shapes countries' capacity to develop environmentally responsible innovations, and how eco‐innovation may, in turn, influence productive sophistication.
Gregory Matheus Pereira de Moraes +1 more
wiley +1 more source
Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives [PDF]
Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ...
Philip Meguire
core