Squares in Fork Arrow Logic

In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational axiomatization. A proper FA is an algebra of relations where the fork is induced by an injective operation coding pair formation. In contrast to RAs, FAs are representable by proper ones and their equational theory has the expressive power of full first-order logic. A square semantics (the set of arrows is U×U for some set U) for arrow logic was defined by Y. Venema. Due to the negative results about the finite axiomatizability of representable RAs, Venema provided a non-orthodox finite axiomatization for arrow logic by adding a new rule governing the applications of a difference operator. We address here the question of extending the type of relational structures to define orthodox axiomatizations for the class of squares. Given the connections between this problem and the finitization problem addressed by I. Németi, we suspect that this cannot be done by using only logical operations. The modal version of the FA equations provides an orthodox axiomatization for FAL which is complete in view of the representability of FAs. Here we review this result and carry it further to prove that this orthodox axiomatization for FAL also axiomatizes the class of fork squares.     

On Fork Arrow Logic and its Expressive Power

We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order correspondence language, so both can express the same input–output behavior of processes.     

Computing with Cylindric Modal Logics and Arrow Logics,Lower Bounds

The complexity of the satisfiability problems of various arrow logics and cylindric modal logics is determined. As is well known, relativising these logics makes them decidable. There are several parameters that can be set in such a relativisation. We focus on the following three: the number of variables involved, the similarity type and the kind of relativised models considered. The complexity analysis shows the importance and relevance of these parameters.     

On Amalgamation in Algebras of Logic

We show that not all epimorphisms are surjective in certain classes of infinite dimensional cylindric algebras, Pinter's substitution algebras and Halmos' quasipolyadic algebras with and without equality. It follows that these classes fail to have the strong amalgamation property. This answers a question in [3] and a question of Pigozzi in his landmark paper on amalgamation [9]. The cylindric case was first proved by Judit Madarasz [7]. The proof presented herein is substantially different. By a result of Németi, our result implies that the Beth-definability Theorem fails for certain expansions of first order logic     

Model Existence in Non-Compact Modal Logic

Predicate modal logics based on Kwith non-compact extra axioms are discussed and a sufficient condition for the model existence theorem is presented. We deal with various axioms in a general way by an algebraic method, instead of discussing concrete non-compact axioms one by one.     

Potential Infinite Models and Ontologically Neutral Logic

The paper begins with a more carefully stated version of ontologically neutral (ON) logic, originally introduced in (Hailperin, 1997). A non-infinitistic semantics which includes a definition of potential infinite validity follows. It is shown, without appeal to the actual infinite, that this notion provides a necessary and sufficient condition for provability in ON logic.     

On Neat Reducts of Algebras of Logic

SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals < , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (i.e. is not a variety) if and only if > 1.From this it easily follows that for 1 < < , the operation of forming -neat reducts of algebras in K does not commute with forming subalgebras, a notion to be made precise.We give a contrasting result concerning Halmos' polyadic algebras (with and without equality). For such algebras, we show that the class of infinite dimensional neat reducts forms a variety.We comment on the status of the property of neat reducts commuting with forming subalgebras for various reducts of polyadic algebras that are also expansions of cylindric-like algebras. We try to draw a borderline between reducts that have this property and reducts that do not.Following research initiated by Pigozzi, we also emphasize the strong tie that links the (apparently non-related) property of neat reducts commuting with forming subalgebras with proving amalgamation results in cylindric-like algebras of relations. We show that, like amalgamation, neat reducts commuting with forming subalgebras is another algebraic expression of definability and, accordingly, is also strongly related to the well-known metalogical properties of Craig, Beth and Robinson in the corresponding logics.     

Some Embedding Theorems for Conditional Logic

We prove some embedding theorems for classical conditional logic, covering ‘finitely cumulative’ logics, ‘preferential’ logics and what we call ‘semi-monotonic’ logics. Technical tools called ‘partial frames’ and ‘frame morphisms’ in the context of neighborhood semantics are used in the proof.     

An Interpolation Theorem for First Order Logic with Infinitary Predicates

An interpolation Theorem is proved for first order logic withinfinitary predicates. Our proof is algebraic via cylindricalgebras.¹     

The Scope and Limitations of Algebras: Some Historical and Philosophical Considerations

An important feature of mathematics, both pure and applied, during the nineteenth century was the widening from its common form to a proliferation, where the “objects” studied were not numbers or geometrical magnitudes but operations such as functions and differentiation and integration, abstract ones (as we now call them), linear algebras of vectors, matrices and determinants, and algebras in logic. In this article the author considers several of them, including the contributions of Hermann Grassmann and Benjamin Peirce. A notable feature of these developments was analogising from one algebra to another by adopting some of the same laws, such as associativity, commutativity and distributivity. In the final section we consider the normally secular character of these algebras.     

Weakly Associative Relation Algebras with Polyadic Composition Operations

In this paper we introduced various classes of weakly associative relation algebras with polyadic composition operations. Among them is the class RWA of representable weakly associative relation algebras with polyadic composition operations. Algebras of this class are relativized representable relation algebras augmented with an infinite set of operations of increasing arity which are generalizations of the binary relative composition. We show that RWA is a canonical variety whose equational theory is decidable.     

Logic and Philosophy of Logic in Wittgenstein

This essay discusses Wittgenstein's conception of logic, early and late, and some of the types of logical system that he constructed. The essay shows that the common view according to which Wittgenstein had stopped engaging in logic as a philosophical discipline by the time of writing Philosophical Investigations is mistaken. It is argued that, on the contrary, logic continued to figure at the very heart of later Wittgenstein's philosophy; and that Wittgenstein's mature philosophy of logic contains many interesting thoughts that have gone widely unnoticed.     

Skepticism and Epistemic Logic

This essay attempts to implement epistemic logic through a non-classical inference relation. Given that relation, an account of '(the individual) a knows that A' is constructed as an unfamiliar non-normal modal logic. One advantage to this approach is a new analysis of the skeptical argument.