On the Semantic Equivalence of Language Syntax Formalisms

There is no computable function that maps an arbitrary closed formula F to an equisatisfiable finite set of monomorphic type instances of F (notice that such a set always exists

We compare and contrast Description Logic (DL) and Order-Sorted Feature (OSF) Logic from the perspective of using them for expressing and reasoning with knowledge struc- tures of

In particular, we adhere to the notions of con- traries, contradictories and subcontraries [1], generated from possible statement types using predicate denial and predicate

Any alternation clause can be made false eitlier by assigning truth (t ) to all of its prefixes and assigning truth values to make its core false, or by assigning

In a and c, data are shown for one single interferometer, in which different particle types were injected: bosonic Fock states blue dots, bosonic thermal states red diamonds,

In Section 4, we use a high-performing blocking method called block purging from the original AC paper as a baseline for evaluating the proposed Sorted Neighborhood workflow..

It is shown that monadic many-sorted signatures can be represented by mono- graphs, and that the corresponding algebras are isomorphic to the mono- graphs typed by the

Previous to this work, three back-end provers with different capabilities were available: Isabelle/ TLA + , a faithful encoding of TLA + set theory in the Isabelle proof