275,054 research outputs found
The Propositional Content of Data
Our online interaction with information-systems may well provide the largest arena of formal logical reasoning in the world today. Presented here is a critique of the foundations of Logic, in which the metaphysical assumptions of such 'closed world' reasoning are contrasted with those of traditional logic. Closed worlds mostly employ a syntactic alternative to formal language namely, recording data in files. Whilst this may be unfamiliar as logical syntax, it is argued here that propositions are expressed by data stored in files which are essentially non-linguistic and so cannot be expressed by simple formulae F(a), with the inference-rules normally used in Logic. Hence, the syntax of data may be said to define a fundamentally new kind of logical form for simple propositions. In this way, the logic of closed systems is shown to be non-classical, differing from traditional logic in its truth-conditions, inferences and metaphysics. This paper will be concerned mainly with how the reference and certain inferences in such a closed system differ metaphysically from classical logic
Quantum Information Dynamics and Open World Science
One of the fundamental insights of quantum mechanics is that complete knowledge of the state of a quantum system is not possible. Such incomplete knowledge of a physical system is the norm rather than the exception. This is becoming increasingly apparent as we apply scientific methods to increasingly complex situations. Empirically intensive disciplines in the biological, human, and geosciences all operate in situations where valid conclusions must be drawn, but deductive completeness is impossible. This paper argues that such situations are emerging examples of {it Open World} Science. In this paradigm, scientific models are known to be acting with incomplete information. Open World models acknowledge their incompleteness, and respond positively when new information becomes available. Many methods for creating Open World models have been explored analytically in quantitative disciplines such as statistics, and the increasingly mature area of machine learning. This paper examines the role of quantum theory and quantum logic in the underpinnings of Open World models, examining the importance of structural features of such as non-commutativity, degrees of similarity, induction, and the impact of observation. Quantum mechanics is not a problem around the edges of classical theory, but is rather a secure bridgehead in the world of science to come
Cognitive Semantics: An Extension of the Cartesian Legacy
The basic intention of this article is to show how the cognitive semantics inherits its ancestry from the Cartesian foundation. The emergence of the cognitive semantics is envisaged here as an integral part of the knowledge evolution, in terms of shifts, which ultimately determines the future direction of our epistemological quest. Basically two questions have been emphasized here: (a) how (and what amount of) common sense metaphysics can be incorporated within the existing system of knowledge; and (b) is there any substratum where the mind-body dualism can be boiled down
Quantum logic as superbraids of entangled qubit world lines
Presented is a topological representation of quantum logic that views
entangled qubit spacetime histories (or qubit world lines) as a generalized
braid, referred to as a superbraid. The crossing of world lines is purely
quantum in nature, most conveniently expressed analytically with
ladder-operator-based quantum gates. At a crossing, independent world lines can
become entangled. Complicated superbraids are systematically reduced by
recursively applying novel quantum skein relations. If the superbraid is closed
(e.g. representing quantum circuits with closed-loop feedback, quantum lattice
gas algorithms, loop or vacuum diagrams in quantum field theory), then one can
decompose the resulting superlink into an entangled superposition of classical
links. In turn, for each member link, one can compute a link invariant, e.g.
the Jones polynomial. Thus, a superlink possesses a unique link invariant
expressed as an entangled superposition of classical link invariants.Comment: 4 page
A CHR-based Implementation of Known Arc-Consistency
In classical CLP(FD) systems, domains of variables are completely known at
the beginning of the constraint propagation process. However, in systems
interacting with an external environment, acquiring the whole domains of
variables before the beginning of constraint propagation may cause waste of
computation time, or even obsolescence of the acquired data at the time of use.
For such cases, the Interactive Constraint Satisfaction Problem (ICSP) model
has been proposed as an extension of the CSP model, to make it possible to
start constraint propagation even when domains are not fully known, performing
acquisition of domain elements only when necessary, and without the need for
restarting the propagation after every acquisition.
In this paper, we show how a solver for the two sorted CLP language, defined
in previous work, to express ICSPs, has been implemented in the Constraint
Handling Rules (CHR) language, a declarative language particularly suitable for
high level implementation of constraint solvers.Comment: 22 pages, 2 figures, 1 table To appear in Theory and Practice of
Logic Programming (TPLP
Innocent strategies as presheaves and interactive equivalences for CCS
Seeking a general framework for reasoning about and comparing programming
languages, we derive a new view of Milner's CCS. We construct a category E of
plays, and a subcategory V of views. We argue that presheaves on V adequately
represent innocent strategies, in the sense of game semantics. We then equip
innocent strategies with a simple notion of interaction. This results in an
interpretation of CCS.
Based on this, we propose a notion of interactive equivalence for innocent
strategies, which is close in spirit to Beffara's interpretation of testing
equivalences in concurrency theory. In this framework we prove that the
analogues of fair and must testing equivalences coincide, while they differ in
the standard setting.Comment: In Proceedings ICE 2011, arXiv:1108.014
From Simple to Complex and Ultra-complex Systems:\ud A Paradigm Shift Towards Non-Abelian Systems Dynamics
Atoms, molecules, organisms distinguish layers of reality because of the causal links that govern their behavior, both horizontally (atom-atom, molecule-molecule, organism-organism) and vertically (atom-molecule-organism). This is the first intuition of the theory of levels. Even if the further development of the theory will require imposing a number of qualifications to this initial intuition, the idea of a series of entities organized on different levels of complexity will prove correct. Living systems as well as social systems and the human mind present features remarkably different from those characterizing non-living, simple physical and chemical systems. We propose that super-complexity requires at least four different categorical frameworks, provided by the theories of levels of reality, chronotopoids, (generalized) interactions, and anticipation
- âŠ