Results 91 to 100 of about 270,225 (234)
Meaning and Reference in Programming Languages
This paper provides an analysis of the meaning–reference problem, as traditionally advanced in the philosophy of language, for imperative programming languages.
Nicola Angius
doaj +1 more source
The Semantics of Axioms from the Perspective of three Muslim Philosophers (Avicenna, Suhrawardi, Mulla Sadra) [PDF]
The explanation of the significance of axioms in the intellectual system of Muslim philosophers is one of the most essential philosophical issues which have received little attention in some aspects despite its great significance and its unique role in ...
Ja’efar Shanazari, Fatemeh Zaare’e
doaj
This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-path
Ciobaca, Stefan +5 more
core +1 more source
Attribute Implication Bases From Galois Connection Structures
ABSTRACT Modeling knowledge systems by determining relationships among key variables have been and currently is a fundamental and nontrivial challenge in real‐world scenarios. Many approaches have been developed to reach this goal, but many of them are heuristic and require of alternative procedures to provide robust and tractable rules.
M. Eugenia Cornejo +2 more
wiley +1 more source
The Relevant Logic E and Some Close Neighbours: A Reinterpretation [PDF]
This paper has two aims. First, it sets out an interpretation of the relevant logic E of relevant entailment based on the theory of situated inference.
Mares, Edwin, Standefer, Shawn
core
Abstract It is well‐recognized in the sciences that a multitude of nonequivalent models are used by researchers to fulfill a range of goals, even for the same target system, a result known broadly as model pluralism. The possibility of the same form of pluralism occurring in logic, however, has not been adequately considered.
Ben Martin
wiley +1 more source
A Machine Proof of the Filter-Method Construction for Real Numbers
This paper presents a machine verification of a real number theory where real numbers are constructed using concepts related to filters. The theory encompasses a special filter, namely the non-principal arithmetical ultrafilter whose existence can be ...
Guowei Dou, Wensheng Yu
doaj +1 more source
Promising Compilation to ARMv8.3
Concurrent programs have behaviors, which cannot be explained by interleaving execution of their threads on a single processing unit due to optimizations, which are performed by modern compilers and CPUs.
A. V. Podkopaev, O. Lahav, V. Vafeiadis
doaj +1 more source
Computation Environments, An Interactive Semantics for Turing Machines (which P is not equal to NP considering it) [PDF]
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the \emph{computation environment}.
Ramezanian, Rasoul
core
Linearism, Universalism and Scope Ambiguities
ABSTRACT In this paper, I distinguish two possible families of semantics of the open future: Linearism, according to which future tense sentences are evaluated with respect to a unique possible future history, and Universalism, according to which future tense sentences are evaluated universally quantifying on the histories passing through the moment of
Aldo Frigerio
wiley +1 more source

