Results 61 to 70 of about 5,812 (235)

Towards a Unified Theory of Operational and Axiomatic Semantics [PDF]

open access: yes, 2012
This paper presents a nine-rule language-independent proof system that takes an operational semantics as axioms and derives program reachability properties, including ones corresponding to Hoare triples. This eliminates the need for language-specific Hoare-style proof rules to verify programs, and, implicitly, the tedious step of proving such proof ...
Rosu, Grigore, Stefanescu, Andrei
openaire   +1 more source

Towards a theory of presence

open access: yesNoûs, EarlyView.
Abstract The present paper presents a new (formal) theory of presence according to which, roughly, to be present at a place is to have a delegate located at that place. One crucial feature of the theory is that something can be present at a place without thereby being located there.
Claudio Calosi
wiley   +1 more source

Structure and Computation

open access: yesNoûs, EarlyView.
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley   +1 more source

Axiomatic Districting [PDF]

open access: yes, 2010
In a framework with two parties, deterministic voter preferences and a type of geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts one party can ...
Tasnádi, Attila, Puppe, Clemens
core   +1 more source

Quiver Gauge Theories: Finitude and Trichotomoty

open access: yesMathematics, 2018
D-brane probes, Hanany-Witten setups and geometrical engineering stand as a trichotomy of standard techniques of constructing gauge theories from string theory.
Yang-Hui He
doaj   +1 more source

Why Are All the Sets All the Sets?

open access: yesNoûs, EarlyView.
ABSTRACT Necessitists about set theory think that the pure sets exists, and are the way they are, as a matter of necessity. They cannot explain why the sets (de rebus) are all the sets. This constitutes the Ur‐Objection against necessitism; it is the primary motivation cited by potentialists about set theory.
Tim Button
wiley   +1 more source

Multimodal Deep Learning for Predicting Deep Vein Thrombosis Risk After Total Knee Arthroplasty: A Clinical Study

open access: yesOrthopaedic Surgery, EarlyView.
Implementing a dual‐branch architecture where ViT‐B/16 or ResNet50 processed standardized radiographs (metal artifact suppression, 512 × 512 resolution) while Clinical‐BERT encoded structured electronic records. A novel dynamic attention mechanism generated sample‐specific weights (α) for feature fusion (α·v_img + (1‐α)·v_txt), with performance ...
Kejia Zhu   +5 more
wiley   +1 more source

Axiomatic Semantics of Data-Parallel Languages; Automatization of Programs Verification [PDF]

open access: yes, 1993
We give a Hoare-like proof system for the data-parallel language L, and we present an automatic tool to aid program correctness proof. After recalling L's operational semantics, we define an axiomatic semantics. We illustrate proof of L programs with two
Mounier, V., Utard, Gil
core   +1 more source

The Abductivist Interpretation of Frege's Conception of Logic

open access: yesAnalytic Philosophy, EarlyView.
ABSTRACT Frege is an abductivist about logic. For him, an acceptable logic must be sufficient—that is, it must be able to explain the relevant data, such as the fact that arithmetical laws are logical truths. Thus, Frege's logicism is an abductive project aimed at establishing the acceptability of his logic, Begriffsschrift.
Junyeol Kim
wiley   +1 more source

Typical Examples of Atoment Language Using

open access: yesМоделирование и анализ информационных систем, 2011
Atoment is a domain-specific language of executable specifications, used to describe methods and techniques of program verification. In this paper a collection of typical examples of the use of the Atoment language, covering topics such as program models,
I. S. Anureev
doaj  

Home - About - Disclaimer - Privacy