In “Sverdlovsk notebook” (Sverdlovsk, 1969), I proposed a question: Are any too first-order equivalent finitely generated commutative semigroups isomorphic? In 1970, B.I.Zilber answered the question negatively. A question arises: In what language, any equivalent over the language finitely generated commutative semigroups are isomorphic? In the note, we propose such a language. Moreover, we prov...

BDDC is a tool for manipulating logical formula. It is based on a Binary Decision Diagram library, that means that each formula is internally tranformed into a canonical form. In particular, if the formula (resp its negation) is a tautologie, BDDC will transform it into the “always true formula” (resp. the “always false formula”). All classical operators are provided. Moreover the tool provides...

this study was an effort towards examining the relationship between iranian efl learners’ language proficiency and their metaphorical competence. the were 120 iranian efl learners studying at sadr english language center within the 19-25 age range. the efl learners’ english proficiency from elementary to advanced which was determined by the opt. afterwards, the students were administered a rese...

for the conference: Logic, Games and Philosophy: Foundational Perspectives Hilbert and Ackermann defined the language of first order predicate logic in such a way that a variable never occurs both free and bound within a single formula, nor can a formula contain nested quantification over the same variable [3, p. 74]. We will call formulas that satisfy these properties regular. Although first o...

This paper studies the design of specification languages through their model theory. We show how language constructs and specification idioms are deeply rooted in the underlying model theory. We also show that some problems are fundamentally difficult to specify due to the underlying foundation of the language. The languages we study are Alloy, Maude, and FORMULA. FORMULA attempts to handle a l...

We study low level nondefinability in the Turing degrees. We prove a variety of results, including for example, that being array nonrecursive is not definable by a Σ1 or Π1 formula in the language (≤, REA) where REA stands for the “r.e. in and above” predicate. In contrast, this property is definable by a Π2 formula in this language. We also show that the Σ1-theory of (D,≤, REA) is decidable.

Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...

Abs t rac t . An extension of the propositional temporal language is introduced with a simple syntactic device, called "reference pointer" which provides for making references within a formula to "instants of reference" specified in the formula. The language with reference pointers/:trp has a great expressive power (e.g. Kamp's and Stavi's operators as well as Prior's clock variables are defina...

Across languages, certain onset clusters are systematically preferred (e.g., [Formula: see text], "[Formula: see text]" indicates preference), and speakers extend these preferences even to onsets that are unattested in their language. All such demonstrations, however, come from cluster-rich languages, so the observed preferences could reflect not universal linguistic restrictions but lexical an...