Whereas a growing bulk of work has demonstrated that both adults and children are sensitive to frequently occurring word sequences, little is known about the potential role of meaning in the processing of such multiword chunks. Here, we take a first step toward assessing the contribution of meaningfulness in the processing of multiword sequences, using items that varied in chunk meaningfulness. In a phrasal-decision study, we compared reaction times for triads of three-word sequences, corresponding to idiomatic expressions, compositional phrases, and (...) phrasal fragments, while controlling for phrase and substring frequencies. Chunk meaningfulness, as assessed by a separate subjective rating study, was found to speed up decision times for all three types of strings: The more meaningful a multiword sequence was judged to be, the faster it was processed, independently of whether it was idiomatic, compositional in nature, or a phrasal fragment. These results highlight the importance of taking meaning into account when considering the processing of multiword chunks, consistent with predictions of construction-based approaches to language. (shrink)

What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

We present a streamlined axiom system of special relativity in first-order logic. From this axiom system we "derive" an axiom system of general relativity in two natural steps. We will also see how the axioms of special relativity transform into those of general relativity. This way we hope to make general relativity more accessible for the non-specialist.

We give two theories, Th1 and Th2, which are explicitly definable over each other , but are not definitionally equivalent. The languages of the two theories are disjoint.

We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...) for every natural number k there is an equation in E containing more than k distinct variables and all the operation symbols, if 2 < n < ω. Completely analogous statement holds for the case n ω. This improves Monk's famous non-finitizability theorem for which we give here a simple proof. We prove analogous nonfinitizability properties of the larger varieties SNrnCAn + k. We prove that the complementation-free subreducts of RCAn do not form a variety. We also investigate the reason for the above “non-finite axiomatizability” behaviour of RCAn. We look at all the possible reducts of RCAn and investigate which are finitely axiomatizable. We obtain several positive results in this direction. Finally, we summarize the results and remaining questions in a figure. We carry through the same programme for RPEAn and for RRA. By looking into the reducts we also investigate what other kinds of natural algebras of relations are possible with more positive behaviour than that of the well known ones. Our investigations have direct consequences for the logical properties of the n-variable fragment Ln of first order logic. The reason for this is that RCAn and RPEAn are the natural algebraic counterparts of Ln while the varieties SNrnCAn + k are in connection with the proof theory of Ln. This paper appears in two parts. The first part contains the non-finite axiomatizability results. The present second part contains finite axiomatizations of some fragments together with a figure summarizing the finite and non-finite axiomatizability results in this area and the problems left open. (shrink)

We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation and cylindric algebras of dimension n (for finite n > 2) with the additional property that they are one-generated and the set of all n by n atomic matrices forms a cylindric basis. We use this construction to show that the classical Henkin-Orey omitting types theorem fails for the finite variable fragments of first order (...) logic as long as the number of variables available is > 2 and we have a binary relation symbol in our language. We also prove a stronger result to the effect that there is no finite upper bound for the extra variables needed in the witness formulas. This result further emphasizes the ongoing interplay between algebraic logic and first order logic. (shrink)

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and Pearce. In Example 2, uncountably many pairs of definitionally inequivalent theories are given such that their model categories are concretely isomorphic via bijections that preserve ultraproducts in the model categories up to isomorphism. Based on these results, we settle several conjectures of Barrett, (...) Glymour and Halvorson. (shrink)

There are eighteen isomorphism types of finite relation algebras with eight or fewer elements, and all of them are representable. We determine all the cardinalities of sets on which these algebras have representations.

A part of relativistic dynamics is axiomatized by simple and purely geometrical axioms formulated within first-order logic. A geometrical proof of the formula connecting relativistic and rest masses of bodies is presented, leading up to a geometric explanation of Einstein’s famous E = mc 2. The connection of our geometrical axioms and the usual axioms on the conservation of mass, momentum and four-momentum is also investigated.

Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable . This theorem and its analogues for quasi-polyadic algebras with and without equality are formulated in Henkin, Monk and Tarski [13]. We introduce a natural and more general notion of rectangular density that can be applied to arbitrary cylindric and quasi-polyadic algebras, not just atomic ones. We then show that every rectangularly dense cylindric algebra is representable, and we extend this result (...) to other classes of algebras of logic, for example quasi-polyadic algebras and substitution-cylindrification algebras with and without equality, relation algebras, and special Boolean monoids. The results of op. cit. mentioned above are special cases of our general theorems. We point out an error in the proof of the Henkin-Monk-Tarski representation theorem for atomic, equality-free, quasi-polyadic algebras with rectangular atoms. The error consists in the implicit assumption of a property that does not, in general, hold. We then give a correct proof of their theorem. Henkin and Tarski also introduced the notion of a rich cylindric algebra and proved in op. cit. that every rich cylindric algebra of finite dimension satisfying certain special identities is representable. We introduce a modification of the notion of a rich algebra that, in our opinion, renders it more natural. In particular, under this modification richness becomes a density notion. Moreover, our notion of richness applies not only to algebras with equality, such as cylindric algebras, but also to algebras without equality. We show that a finite dimensional algebra is rich iff it is rectangularly dense and quasi-atomic; moreover, each of these conditions is also equivalent to a very natural condition of point density . As a consequence, every finite dimensional rich algebra of logic is representable. We do not have to assume the validity of any special identities to establish this representability. Not only does this give an improvement of the Henkin-Tarski representation theorem for rich cylindric algebras, it solves positively an open problem in op. cit. concerning the representability of finite dimensional rich quasi-polyadic algebras without equality. (shrink)

A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We present our main construction in terms of polygroupoids.

Rankings of politicalparties are often used to map the multiple party preference of the electorate. This article shows how the obtained rankings may be analysed by means of the exploded logit-technique, which allows for testing both the difference between the rankings and the effect of either categorical or quantitative independent variables on the rankings. An analysis of the effect of age on the party preference rankings of the christian democratie electorate in the 1991 Belgian parliamentary election shows that the older (...) CVP-voters tend to rank the liberal and the socialist party equally, white the younger voters hesitate between the liberal and the green party. The younger CVP-voters are also significantly less averse of the far-right Vlaams Blok. (shrink)

We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...) for every natural number k there is an equation in E containing more than k distinct variables and all the operation symbols, if 2 < n < ω. Completely analogous statement holds for the case n ω. This improves Monk's famous non-finitizability theorem for which we give here a simple proof. We prove analogous nonfinitizability properties of the larger varieties SNrnCAn + k. We prove that the complementation-free subreducts of RCAn do not form a variety. We also investigate the reason for the above “non-finite axiomatizability” behaviour of RCAn. We look at all the possible reducts of RCAn and investigate which are finitely axiomatizable. We obtain several positive results in this direction. Finally, we summarize the results and remaining questions in a figure. We carry through the same programme for RPEAn and for RRA. By looking into the reducts we also investigate what other kinds of natural algebras of relations are possible with more positive behaviour than that of the well known ones. Our investigations have direct consequences for the logical properties of the n-variable fragment Ln of first order logic. The reason for this is that RCAn and RPEAn are the natural algebraic counterparts of Ln while the varieties SNrnCAn + k are in connection with the proof theory of Ln. This paper appears in two parts. The first part contains the non-finite axiomatizability results. The present second part contains finite axiomatizations of some fragments together with a figure summarizing the finite and non-finite axiomatizability results in this area and the problems left open. (shrink)

We investigate in an algebraic setting the question of which logical languages can express the properties integral, permutational, and rigid for algebras of relations.

We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order logic.

We shall show that certain natural and interesting intervals in the lattice of varieties of representable relation algebras embed the lattice of all subsets of the natural numbers, and therefore must have a very complicated lattice-theoretic structure.

This is an abstract of our paper \A characterisation of Floyd-provable programs" submitted to Theoretical Computer Science. ! denotes the set of natural numbers. Y =d fyi : i 2 !g is the set of variable symbols. L denotes the set of classical rst order formulas of type t possibly with free variables , where t is the similarity type of arithmetic, i.e. it consists of \+; ; 0; 1" with arities \2; 2; 0; 0".

It is shown that Tarski’s set of ten axioms for the calculus of relations is independent in the sense that no axiom can be derived from the remaining axioms. It is also shown that by modifying one of Tarski’s axioms slightly, and in fact by replacing the right-hand distributive law for relative multiplication with its left-hand version, we arrive at an equivalent set of axioms which is redundant in the sense that one of the axioms, namely the second involution law, (...) is derivable from the other axioms. The set of remaining axioms is independent. Finally, it is shown that if both the left-hand and right-hand distributive laws for relative multiplication are included in the set of axioms, then two of Tarski’s other axioms become redundant, namely the second involution law and the distributive law for converse. The set of remaining axioms is independent and equivalent to Tarski’s axiom system. (shrink)

Theorem 1 states a negative result about the classical semantics j= ! of program schemes. Theorem 2 investigates the reason for this. We conclude that Theorem 2 justies the Henkin-type semantics j= for which the opposite of the present Theorem 1 was proved in [1]{[3] and also in a dierent form in part III of [5]. The strongest positive result on j= is Corollary 6 in [3].

We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.

IntroductionMentalizing is a key aspect of social cognition. Several researchers assume that mentalization has two systems, an explicit one and an implicit one. In schizophrenia, several studies have confirmed the deficit of explicit mentalizing, but little data are available on non-explicit mentalizing. However, increasing research activity can be detected recently in implicit mentalizing. The aim of this systematic review and meta-analysis is to summarize the existing results of implicit mentalizing in schizophreniaMethodsA systematic search was performed in four major databases: MEDLINE, (...) EMBASE, Cochrane Central Register of Controlled Trials, Web of Science. Eleven publications were selected. Five studies were found to be eligible for quantitative synthesis, and 9 studies were included in qualitative synthesis.ResultsThe meta-analysis revealed significantly lower accuracy, slower reaction time during implicit mentalizing in patients with schizophrenia. The systematic review found different brain activation pattern, further alterations in visual scanning, cue fixation, face looking time, and difficulties in perspective taking.DiscussionOverall, in addition to the deficit of explicit mentalization, implicit mentalization performance is also affected in schizophrenia, if not to the same extent. It seems likely that some elements of implicit mentalization might be relatively unaffected, but the effectiveness is limited by certain neurocognitive deficits. These alterations in implicit mentalizing can also have potential therapeutic consequences.Systematic Review Registration:https://www.crd.york.ac.uk/prospero/, identifier: CRD42021231312. (shrink)

We investigate Kerr–Newman black holes in which a rotating charged ring-shaped singularity induces a region which contains closed timelike curves (CTCs). Contrary to popular belief, it turns out that the time orientation of the CTC is oppo- site to the direction in which the singularity or the ergosphere rotates. In this sense, CTCs “counter-rotate” against the rotating black hole. We have similar results for all spacetimes sufficiently familiar to us in which rotation induces CTCs. This motivates our conjecture that perhaps (...) this counter-rotation is not an accidental oddity particular to Kerr–Newman spacetimes, but instead there may be a general and intuitively comprehensible reason for this. (shrink)

In 1941, Tarski published an abstract, finitely axiomatized version of the theory of binary relations, called the theory of relation algebras, He asked whether every model of his abstract theory could be represented as a concrete algebra of binary relations. He and Jonsson obtained some initial, positive results for special classes of abstract relation algebras. But Lyndon showed, in 1950, that in general the answer to Tarski's question is negative. Monk proved later that the answer remains negative even if one (...) adjoins finitely many new axioms to Tarski's system. In this paper we describe a far-reaching generalization of the positive results of Jonsson and Tarski, as well as of some later, related results of Maddux. We construct a class of concrete models of Tarski's axioms-called coset relation algebras-that are very close in spirit to algebras of binary relations, but are built using systems of groups and cosets instead of elements of a base set. The models include all algebras of binary relations, and many non-representable relation algebras as well, We prove that every atomic relation algebra satisfying a certain measurability condition-a condition generalizing the conditions imposed by Jonsson and Tarski-is essentially isomorphic to a coset relation algebra. The theorem raises the possibility of providing a positive solution to Tarski's problem by using coset relation algebras instead of the standard algebras of binary relations. (shrink)

The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version of the (...) Lambek Calculus where we admit the empty sequence as the antecedent of a sequent is strongly complete w.r.t. those relational models whereW=U×U for some setU. We will also look into extendability of this completeness result to various fragments of Girard's Linear Logic as suggested in van Benthem (1991), p. 235, and investigate the connection between the Lambek Calculus and language models. (shrink)

It is shown that for any cardinal $\kappa, \dbinom{(2^{ , and if κ is weakly compact $\dbinom{\kappa^+}{\kappa} \rightarrow \dbinom{\kappa}{\kappa}_{.