We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
In this paper we examine some previous AI and Law attempts to characterise standards of proof, and relate these to the notions of acceptability found in argumentation frameworks, ...
The Quantum Substate Theorem due to Jain, Radhakrishnan, and Sen [7] gives us a powerful operational interpretation of the observational divergence of two quantum states, a quanti...
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...