Related papers: Hilbert's epsilon as an Operator of Indefinite Com…
Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…
Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…
Any intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in…
In \cite{BK} Parseval frames were used to define bounded Hamiltonians, both in finite and in infinite dimesional Hilbert spaces. Here we continue this analysis, with a particular focus on the discrete spectrum of Hamiltonian operators…
Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…
(To appear in Theory and Practice of Logic Programming (TPLP)) ESmodels is designed and implemented as an experiment platform to investigate the semantics, language, related reasoning algorithms, and possible applications of epistemic…
We extend the formulation of pseudo-Hermitian quantum mechanics to eta-pseudo-Hermitian Hamiltonian operators H with an unbounded metric operator eta. In particular, we give the details of the construction of the physical Hilbert space,…
In 1991, Michael Gelfond introduced the language of epistemic specifications. The goal was to develop tools for modeling problems that require some form of meta-reasoning, that is, reasoning over multiple possible worlds. Despite their…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…
In infinite-dimensional Hilbert spaces, the application of the concept of quasi-Hermiticity to the description of non-Hermitian Hamiltonians with real spectra may lead to problems related to the definition of the metric operator. We discuss…
Making a linguistic theory is like making a programming language: one typically devises a type system to delineate the acceptable utterances and a denotational semantics to explain observations on their behavior. Via this connection, the…
Traditional machine learning models, particularly neural networks, are rooted in finite-dimensional parameter spaces and nonlinear function approximations. This report explores an alternative formulation where learning tasks are expressed…
In Probabilistic Logic Nilsson uses the device of a probability distribution over a set of possible worlds to assign probabilities to the sentences of a logical language. In his paper Nilsson concentrated on inference and associated…
In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…
The extended semantic realism (ESR) model recently worked out by one of the authors embodies the mathematical formalism of standard (Hilbert space) quantum mechanics in a noncontextual framework, reinterpreting quantum probabilities as…
In this note, we frst consider boundedness properties of a family of operators generalizing the Hilbert operator in the upper triangle case. In the diagonal case, we give the exact norm of these operators under some restrictions on the…
As is evident in the programming language literature, many practitioners favor specifying dynamic program behavior using big-step over small-step semantics. Unlike small-step semantics, which must dwell on every intermediate program state,…
Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized…
There are three upper limits (2, 2.sqrt{2}, 2.sqrt{3}) of the Bell operator corresponding to different physical concepts: classical, hidden-variable and quantum-mechanical. Only the classical concept corresponding to the lowest limit has…
In this note one tries to venture into a study of some notions, in the context of a (unital) normed algebra, in particular the algebra of operators on a Hilbert space. Namely, one considers ``moving norms'', i.e.\ norming an element minus a…