The SCAN algorithm has been proposed for second order quanti er elimination. In particular it can be applied to nd correspondence axioms for systems of modal logic. Up to now, what has been studied are systems with unary modal operators. In this paper we study how SCAN can be applied to various systems of conditional logic, which are logical systems with binary modal operators.

The title compound, C(13)H(15)BrClNO, was prepared by the condensation of equimolar quanti-ties of 3-bromo-5-chloro-salicyl-aldehyde with cyclo-hexyl-amine in methanol. There is an intra-molecular O-H⋯N hydrogen bond in the mol-ecule. The cyclo-hexyl ring adopts a chair conformation.

We consider the compilation of diierent reasoning tasks into the evaluation problem of quantiied boolean formulas (QBFs) as an approach to develop prototype reasoning systems useful, e.g., for experimental purposes. Such a method is a natural generalization of a similar technique applied to NP-problems and has been recently proposed by other researchers. More specifically , we present translati...

There is a sharp divide between quantitative and qualitative methodologies in the social sciences. We investigate an innovative way to bridge this gap that incorporates quantitative techniques into a qualitative method, the “quanti-qualitative method” (QQM). Specifically, our research utilized small survey questionnaires and experiment-like activities as part of the question route in a series o...

With the rapid development of 3D imaging technology, the wide usage of 3D surface information for research and applications is becoming a convenient reality. This study is focused on a quanti ed analysis of facial asymmetry of more than 100 3D human faces (individuals). We investigate whether facial asymmetry di ers statistically signi cantly from a bilateral symmetry assumption, and the role o...

This paper describes the design and implementation of an oo-line, non-invasive, automated method for the examination and follow up of the arteriosclerotic changes due to hypertension, with the help of digital image processing of fundus images. This method would help in evaluating the eecacy of various treatments on the regression and reversion of arteriosclerotic lesions. This method, in intera...

It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...

In [Fer10] Feron presents how Lyapunov-theoretic proofs of stability can be migrated toward computer-readable and verifiable certificates of control software behavior by relying of Floyd’s and Hoare’s proof system. We address the issue of errors resulting from the use of floating-point arithmetic: we present an approach to translate Feron’s proof invariants on real arithmetic to similar invaria...

We deene process algebras with a generalised operation P for choice. For every innnite cardinal , we prove that the algebra of transition trees with branching degree < is free in the class of process algebras in which P is deened for all subsets with a cardinality <. We explain how the expressions of a fragment of the speciication language CRL may be used to denote elements of our process algeb...