Related papers: Scalar and Vectorial mu-calculus with Atoms
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…
The application of molecular dynamics (MD) simulations to the interpretation of Raman scattering spectra is hindered by inability of atomistic simulations to account for the dynamic evolution of electronic polarizability, requiring the use…
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
An integrable Hamiltonian system presents monodromy if the action-angle variables cannot be defined globally. As a prototype of classical monodromy with azimuthal symmetry, we consider a linear molecule interacting with external fields and…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of…
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…
Precision tests of the Standard Model and searches for beyond the Standard Model physics often require nuclear structure input. There has been a tremendous progress in the development of nuclear ab initio techniques capable of providing…
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
Mathematical reasoning---a core ability within human intelligence---presents some unique challenges as a domain: we do not come to understand and solve mathematical problems primarily on the back of experience and evidence, but on the basis…
Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…
By putting together an abstract view on quantum mechanics and a quantum-optics picture of the interactions of an atom with light, we develop a corresponding set of C++ classes that set up the numerical analysis of an atom with an arbitrary…
In this paper we are concerned with understanding the nature of program metrics for calculi with higher-order types, seen as natural generalizations of program equivalences. Some of the metrics we are interested in are well-known, such as…
We show that if the structural rules are admissible over a set R of atomic rules, then they are admissible in the sequent calculus obtained by adding the rules in R to G3[mic]. Two applications to pure logic and to the sequent calculus with…
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…
Classical mechanics can be formulated using a symplectic structure on classical phase space, while quantum mechanics requires a complex-differentiable structure on that same space. Complex-differentiable structures on a given real manifold…
Dynamic arrays, also referred to as vectors, are fundamental data structures used in many programs. Modeling their semantics efficiently is crucial when reasoning about such programs. The theory of arrays is widely supported but is not…