Related papers: The Hamiltonian Syllogistic
We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the…
Canonical expressions are representative of implicative propositions upto renaming of variables. In this paper we explore, using a Monte-Carlo approach, the model of canonical expressions in order to confirm the paradox that says that…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
Some mathematical theories in physics justify their explanatory superiority over earlier formalisms by the clarity of their postulates. In particular, axiomatic reconstructions drive home the importance of the composition rule and the…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
Detecting semantic arguments of a predicate word has been conventionally modeled as a sentence-level task. The typical reader, however, perfectly interprets predicate-argument relations in a much wider context than just the sentence where…
Functional Distributional Semantics provides a computationally tractable framework for learning truth-conditional semantics from a corpus. Previous work in this framework has provided a probabilistic version of first-order logic, recasting…
The Hamiltonian constraint system is the canonical formulation of a physical system with a Hamiltonian constrained to vanish. In terms of the canonical variables, we define what we call reference observable, with respect to which other…
The modal analysis is revisited through the symplectic formalism, what leads to two intertwined eigenproblems. Studying the properties of the solutions, we prove that they form a canonical basis. The method is general and works even if the…
This papers is concerned with multisymplectic formalisms which are the frameworks for Hamiltonian theories for fields theory. Our main purpose is to study the observable $(n-1)$-forms which allows one to construct observable functionals on…
By complexifying a Hamiltonian system one obtains dynamics on a holomorphic symplectic manifold. To invert this construction we present a theory of real forms which not only recovers the original system but also yields different real…
The formulation of a relativistic dynamical problem as a system of Hamilton equations by respecting the principles of Relativity is a delicate task, because in their classical form the Hamilton equations require the use of a time…
This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While…
This is a pedagogical and (almost) self-contained introduction into the theorem of Groenewold and van Howe, which states that a naive transcription of Dirac's quantisation rules cannot work. Some related issues in quantisation theory are…
In this paper we obtain a 2+2 double null Hamiltonian description of General Relativity using only the (complex) SO(3) connection and the components of the complex densitised self-dual bivectors. We carry out the general canonical analysis…
Heisenberg motion equations in Quantum mechanics can be put into the Hamilton form. The difference between the commutator and its principal part, the Poisson bracket, can be accounted for exactly. Canonical transformations in Quantum…
We present a coherence-based probability semantics and probability propagation rules for (categorical) Aristotelian syllogisms. For framing the Aristotelian syllogisms as probabilistic inferences, we interpret basic syllogistic sentence…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…