94 research outputs found
Weak nuclear forces cause the strong nuclear force
We determine the strength of the weak nuclear force which holds the lattices
of the elementary particles together. We also determine the strength of the
strong nuclear force which emanates from the sides of the nuclear lattices. The
strong force is the sum of the unsaturated weak forces at the surface of the
nuclear lattices. The strong force is then about ten to the power of 6 times
stronger than the weak force between two lattice points.Comment: 12 pages, 1 figur
A dependent nominal type theory
Nominal abstract syntax is an approach to representing names and binding
pioneered by Gabbay and Pitts. So far nominal techniques have mostly been
studied using classical logic or model theory, not type theory. Nominal
extensions to simple, dependent and ML-like polymorphic languages have been
studied, but decidability and normalization results have only been established
for simple nominal type theories. We present a LF-style dependent type theory
extended with name-abstraction types, prove soundness and decidability of
beta-eta-equivalence checking, discuss adequacy and canonical forms via an
example, and discuss extensions such as dependently-typed recursion and
induction principles
Kripke Semantics for Martin-L\"of's Extensional Type Theory
It is well-known that simple type theory is complete with respect to
non-standard set-valued models. Completeness for standard models only holds
with respect to certain extended classes of models, e.g., the class of
cartesian closed categories. Similarly, dependent type theory is complete for
locally cartesian closed categories. However, it is usually difficult to
establish the coherence of interpretations of dependent type theory, i.e., to
show that the interpretations of equal expressions are indeed equal. Several
classes of models have been used to remedy this problem. We contribute to this
investigation by giving a semantics that is standard, coherent, and
sufficiently general for completeness while remaining relatively easy to
compute with. Our models interpret types of Martin-L\"of's extensional
dependent type theory as sets indexed over posets or, equivalently, as
fibrations over posets. This semantics can be seen as a generalization to
dependent type theory of the interpretation of intuitionistic first-order logic
in Kripke models. This yields a simple coherent model theory, with respect to
which simple and dependent type theory are sound and complete
Interaction of a CO molecule with a Pt monoatomic chain: the top geometry
Recent experiments showed that the conductance of Pt nanocontacts and
nanowires is measurably reduced by adsorption of CO. We present DFT
calculations of the electronic structure and ballistic conductance of a Pt
monoatomic chain and a CO molecule adsorbed in an on-top position. We find that
the main electronic molecule-chain interaction occurs via the and
orbitals of the molecule, involved in a donation/back-donation
process similar to that of CO on transition-metal surfaces. The ideal ballistic
conductance of the monoatomic chain undergoes a moderate reduction by about 1.0
G_0 (from 4 G_0 to 3.1 G_0) upon adsorption of CO. By repeating all
calculations with and without spin-orbit coupling, no substantial spin-orbit
induced change emerges either in the chain-molecule interaction mechanism or in
the conductance.Comment: 4 pages, 2 figures, in proceedings of Frontiers of Fundamental and
Computational Physic
The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms
The literature specifies extensive-form games in many styles, and eventually
I hope to formally translate games across those styles. Toward that end, this
paper defines , the category of node-and-choice forms. The
category's objects are extensive forms in essentially any style, and the
category's isomorphisms are made to accord with the literature's small handful
of ad hoc style equivalences.
Further, this paper develops two full subcategories: for
forms whose nodes are choice-sequences, and for forms whose
nodes are choice-sets. I show that is "isomorphically enclosed"
in in the sense that each form is isomorphic to
a form. Similarly, I show that is
isomorphically enclosed in in the sense that each
form with no-absentmindedness is isomorphic to a
form. The converses are found to be almost immediate, and the
resulting equivalences unify and simplify two ad hoc style equivalences in
Kline and Luckraz 2016 and Streufert 2019.
Aside from the larger agenda, this paper already makes three practical
contributions. Style equivalences are made easier to derive by [1] a natural
concept of isomorphic invariance and [2] the composability of isomorphic
enclosures. In addition, [3] some new consequences of equivalence are
systematically deduced.Comment: 43 pages, 9 figure
Imperative Object-based Calculi in (Co)Inductive Type Theories
We discuss the formalization of Abadi and Cardelli's imps, a paradigmatic object-based calculus with types and side effects, in Co-Inductive Type Theories, such as the Calculus of (Co)Inductive Constructions (CC(Co)Ind).
Instead of representing directly the original system "as it is", we reformulate its syntax and semantics bearing in mind the proof-theoretical features provided by the target metalanguage. On one hand, this methodology allows for a smoother implementation and treatment of the calculus in the metalanguage. On the other, it is possible to see the calculus from a new perspective, thus having the occasion to suggest original and cleaner presentations.
We give hence anew presentation of imps, exploiting natural deduction semantics, (weak) higher-order abstract syntax, and, for a significant fragment of the calculus, coinductive typing systems. This presentation is easier to use and implement than the original one, and the proofs of key metaproperties, e.g. subject reduction, are much simpler.
Although all proof developments have been carried out in the Coq system, the solutions we have devised in the encoding of and metareasoning on imps can be applied to other imperative calculi and proof environments with similar features
A coinductive semantics of the Unlimited Register Machine
We exploit (co)inductive specifications and proofs to approach the evaluation of low-level programs for the Unlimited Register Machine (URM) within the Coq system, a proof assistant based on the Calculus of (Co)Inductive Constructions type theory. Our formalization allows us to certify the implementation of partial functions, thus it can be regarded as a first step towards the development of a workbench for the formal analysis and verification of both converging and diverging computations
- …