A modal logic is developed to deal with finite ordered binary trees a they are used in linguistics. A modal language is introduced with operators for the ‘mother of’, ‘first daughter of’ and ‘second daughter of’ relations together with their transitive reflexive closures. The relevant class of tree models is defined and three linguistic applications of this language are discussed: context free grammars, command relations, and trees decorated with feature structures. An axiomatic proof system is given for which completeness (...) is shown with respect to the class of finite ordered binary trees. A number of decidability results follow. (shrink)

Many intermediate logics, even extremely well-behaved ones such as IPC, lack the finite model property for admissible rules. We give conditions under which this failure holds. We show that frames which validate all admissible rules necessarily satisfy a certain closure condition, and we prove that this condition, in the finite case, ensures that the frame is of width 2. Finally, we indicate how this result is related to some classical results on finite, free Heyting algebras.

Let be a finite collection of finite algebras of finite signature such that SP( ) has meet semi-distributive congruence lattices. We prove that there exists a finite collection 1 of finite algebras of the same signature, , such that SP( 1) is finitely axiomatizable.We show also that if , then SP( 1) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract (...) indicates. (shrink)

Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene and Bochvar–Kleene logics, we modify them by replacing the multiple-conclusion rules with carefully selected single-conclusion ones. In this way we manage to introduce the first finite Hilbert-style single-conclusion axiomatizations for these logics.

We study the finite frame property of some extensions of Fitting, Marek, and Truszczyński’s pure logic of necessitation $$\textbf{N}$$ N. For any natural numbers m, n, we introduce the logic $$\textbf{N}^+\textbf{A}_{m,n}$$ N + A m, n by adding the single axiom scheme $$\Box ^n \varphi \rightarrow \Box ^m \varphi $$ □ n φ → □ m φ and the rule $$\dfrac{\lnot \Box \varphi }{\lnot \Box \Box \varphi }$$ ¬ □ φ ¬ □ □ φ ($${\text {Ros}}^\Box $$ Ros □ ) (...) into $$\textbf{N}$$ N. We prove the finite frame property of $$\textbf{N}^+\textbf{A}_{m, n}$$ N + A m, n with respect to Fitting, Marek, and Truszczyński’s relational semantics. We also prove that for $$n \ge 2$$ n ≥ 2, the logic obtained by removing the rule $${\text {Ros}}^\Box $$ Ros □ from $$\textbf{N}^+\textbf{A}_{0, n}$$ N + A 0, n is incomplete with respect to that semantics. (shrink)

We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.

A proof-theoretical analysis of finite-valuedness in the domain of cumulative inference systems is presented.

The finite model property (FMP) in weakly transitive tense logics is explored. Let \(\mathbb {S}=[\textsf{wK}_t\textsf{4}, \textsf{K}_t\textsf{4}]\) be the interval of tense logics between \(\textsf{wK}_t\textsf{4}\) and \(\textsf{K}_t\textsf{4}\). We introduce the modal formula \(\textrm{t}_0^n\) for each \(n\ge 1\). Within the class of all weakly transitive frames, \(\textrm{t}_0^n\) defines the class of all frames in which every cluster has at most _n_ irreflexive points. For each \(n\ge 1\), we define the interval \(\mathbb {S}_n=[\textsf{wK}_t\textsf{4T}_0^{n+1}, \textsf{wK}_t\textsf{4T}_0^{n}]\) which is a subset of \(\mathbb {S}\). There are (...) \(2^{\aleph _0}\) logics in \(\mathbb {S}_n\) lacking the FMP, and there are \(2^{\aleph _0}\) logics in \(\mathbb {S}_n\) having the FMP. Then we explore the FMP in finitely alternative tense logics \(L_{n,m}=L\oplus \{\textrm{Alt}_n^F, \textrm{Alt}_m^P\}\) with \(n,m\ge 0\) and \(L\in \mathbb {S}\). For all \(k\ge 0\) and \(n,m\ge 1\), we define intervals \(\mathbb {F}^k_{n,m}\), \(\mathbb {P}^k_{n,m}\) and \(\mathbb {S}^k_{n,m}\) of tense logics. The number of logics lacking the FMP in them is either 0 or \(2^{\aleph _0}\), and the number of logics having the FMP in them is either finite or \(2^{\aleph _0}\). (shrink)

This paper presents a generalization of Fine’s completeness theorem for transitive logics of finite width, and proves the Kripke completeness of transitive logics of finite “suc-eq-width”. The frame condition for each finite suc-eq-width axiom requires, in rooted transitive frames, a finite upper bound of cardinality for antichains of points with different proper successors. The paper also presents a generalization of Rybakov’s completeness theorem for transitive logics of prefinite width, and proves the Kripke completeness of transitive logics of prefinite “suc-eq-width”. The (...) frame condition for each prefinite suc-eq-width axiom requires, in rooted transitive frames, a finite upper bound of cardinality for antichains of points that have a finite lower bound of depth and have different proper successors. We will construct continuums of transitive logics of finite suc-eq-width but not of finite width, and continuums of those of prefinite suc-eq-width but not of prefinite width. This shows that our new completeness results cover uncountably many more logics than Fine’s theorem and Rybakov’s theorem respectively. (shrink)

In this paper, we concentrate on finite quasivarieties (i.e. classes of finite algebras defined by quasi-identities). We present a motivation for studying finite quasivarieties. We introduce a new type of conditions that is well suited for defining finite quasivarieties and compare these new conditions with quasi-identities.

In this paper it is argued that certain stimulus-response learning models which are adequate to represent finite automata (acceptors) are not adequate to represent noninitial state input-output automata (transducers). This circumstance suggests the question whether or not the behavior of animals if satisfactorily modelled by automata is predictive. It is argued in partial answer that there are automata which can be explained in the sense that their transition and output functions can be described (roughly, Hempel-type covering law explanation) while their (...) behaviors are in principle not predictable short of possession of their complete histories or of information concerning present internal states by indirect observation. (shrink)

We study a class of finite models for the Lambek Calculus with additive conjunction and with and without empty antecedents. The class of models enables us to prove the finite model property for each of the above systems, and for some axiomatic extensions of them. This work strengthens the results of [3] where only product-free fragments of these systems are considered. A characteristic feature of this approach is that we do not rely on cut elimination in opposition to e.g. [5], (...) [9]. (shrink)

In this study, we apply MOSAIC (model of syntax acquisition in children) to the simulation of the developmental patterning of children's optional infinitive (OI) errors in 4 languages: English, Dutch, German, and Spanish. MOSAIC, which has already simulated this phenomenon in Dutch and English, now implements a learning mechanism that better reflects the theoretical assumptions underlying it, as well as a chunking mechanism that results in frequent phrases being treated as 1 unit. Using 1, identical model that learns from child‐directed (...) speech, we obtain a close quantitative fit to the data from all 4 languages despite there being considerable cross‐linguistic and developmental variation in the OI phenomenon. MOSAIC successfully simulates the difference between Spanish (a pro‐drop language in which OI errors are virtually absent) and obligatory subject languages that do display the OI phenomenon. It also highlights differences in the OI phenomenon across German and Dutch, 2 closely related languages whose grammar is virtually identical with respect to the relation between finiteness and verb placement. Taken together, these results suggest that (a) cross‐linguistic differences in the rates at which children produce OIs are graded, quantitative differences that closely reflect the statistical properties of the input they are exposed to and (b) theories of syntax acquisition need to consider more closely the role of input characteristics as determinants of quantitative differences in the cross‐linguistic patterning of phenomena in language acquisition. (shrink)

The aim of this paper is to show that the implicational fragment BKof the intuitionistic propositional calculus (IPC) without the rules of exchange and contraction has the finite model property with respect to the quasivariety of left residuation algebras (its equivalent algebraic semantics). It follows that the variety generated by all left residuation algebras is generated by the finite left residuation algebras. We also establish that BKhas the finite model property with respect to a class of structures that constitute a (...) Kripke-style relational semantics for it. The results settle a question of Ono and Komori [OK85]. (shrink)

A logic in a finite language is said to be finitely presentable if it is axiomatized by finitely many finite rules. It is proved that binary non-indexed products of logics that are both finitely presentable and finitely equivalential are essentially finitely presentable. This result does not extend to binary non-indexed products of arbitrary finitely presentable logics, as shown by a counterexample. Finitely presentable logics are then exploited to introduce finitely presentable Leibniz classes, and to draw a parallel between the Leibniz (...) and the Maltsev hierarchies. (shrink)

In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph's nodes. Such theories, which we call annotation theories^ can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, (...) specification of preferred models and model checking problem. We show that most of considered problems are NPTime- or co-NPTime-complete. In order to reduce the complexity for particular theories, we use second-order quantifier elimination. To our best knowledge none of existing methods works in the case of annotation theories. We then provide a new second-order quantifier elimination method for stratified theories, which is successful in the considered cases. The new result subsumes many other results, including those of [2, 28, 21]. (shrink)

We define and prove a formal semantics divided into two complementary interacting components: the strictly linguistic semantics, we call linguistic agent, and the strictly logical and referential semantics, we call rational agent. This Linguistic \ Rational Agents’ Semantics applies to Deep Dependency trees or more generally, to discourses, i.e. sequences of DD-trees, and interprets them by functional structures we call Meaning Representation Structures, similar to the DRT, but interpreted very differently. LRA semantics incrementally interprets the discourses by minimal finite models, (...) called proto-models, in a monotonic logic of the LA and checks the proto-models with respect to the classical models of the RA. The proto-model is considered as the linguistic sense of the discourse. We define in full detail the LA which, as we believe, must be universal. On the other hand, we don’t propose a particular RA. We only define the scheme of interaction between the two agents and the stimuli of the RA used by the LA. After all, every discourse has in LRA semantics the single meaning and the single sense for every Rational Agent used to interact with the Linguistic Agent. (shrink)

We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...) examples of Kripke incomplete normal bimodal logics which are nevertheless coNP-complete. (shrink)

The paper considers a version of the problem of linguistic creativity obtained by interpreting attributions of ordinary semantic knowledge as attributions of practical competencies with expressions. The paper explains how to cope with this version of the problem without invoking either compositional theories of meaning or the notion of `tacit knowledge' (of such theories) that has led to unnecessary puzzlement. The central idea is to show that the core assumption used to raise the problem is false. To render precise argument (...) possible, the paper first identifies and removes some relevant semantic indeterminacy in philosophical talk of `semantic knowledge' and `information'. This yields rules for attributing the two to human speakers and information-processors, respectively. The paper then shows, first, that ordinary speakers qualify as possessing all along an other than finite and definite stock of semantic knowledge and, second, that a very simple information-processor running a procedural semantics qualifies as possessing an analogous stock of semantic information. The second result is used to bring out that the first is neither unduly impressive nor particularly puzzling. (shrink)

We present a theory that copes with the dynamics of inconsistent information. A method is set forth to represent possibly inconsistent information by a finite state. Next, finite operations for expansion and contraction of finite states are given. No extra-logical element — a choice function or an ordering over (sets of) sentences — is presupposed in the definition of contraction. Moreover, expansion and contraction are each other's duals. AGM-style characterizations of these operations follow.

Strict finitism is a minority view in the philosophy of mathematics. In this paper, we develop a strict finite axiomatic system for geometric constructions in which only constructions that are executable by simple tools in a small number of steps are permitted. We aim to demonstrate that as far as the applications of synthetic geometry to real-world constructions are concerned, there are viable strict finite alternatives to classical geometry where by one can prove analogs to fundamental results in classical geometry. (...) We consider this as one of many early steps investigating the extent to which strict finite foundations can be developed for the application of mathematics to the real-world. (shrink)

We present a new infinite family of finite-valued paraconsistent logics—whose _n_-th member we call _Sette’s logic of order_ _n_ and denote by \({\mathscr {S}}_n\) —all of which extending da Costa’s logic \({\mathscr {C}}_1\) and extended by classical logic \(\mathcal {C\!\hspace{0.0pt}L}\). We classify the family \(\{ {\mathscr {S}}_n: n \ge 2 \}\) within the Leibniz hierarchy by proving that all its members are finitely algebraizable. We also prove a completeness theorem for each logic \({\mathscr {S}}_n\) wrt. a single logical matrix and (...) characterize the quasivariety \({\textsf{Alg}}^*({\mathscr {S}}_n)\). Finally, we consider the infimum of the family \(\{ {\mathscr {S}}_n: n \ge 2 \}\) and prove that unlike Sette’s logic of any given finite order, the logic \({\mathscr {S}}_\infty = \bigcap _{n \ge 2} {\mathscr {S}}_n\) is not finitary. Furthermore, we establish a completeness result for the logic \({\mathscr {S}}_\infty \) as well as characterize the generalized quasivariety \({\textsf{Alg}}^*\big ( {\mathscr {S}}_\infty \big )\). We conclude with analogous results for the finitary companion of \({\mathscr {S}}_\infty \). (shrink)

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.

Let \(\textbf{K}\) and \(\textbf{M}\) be locally finite quasivarieties of finite type such that \(\textbf{K}\subset \textbf{M}\). If \(\textbf{K}\) is profinite then the filter \([\textbf{K},\textbf{M}]\) in the quasivariety lattice \(\textrm{Lq}(\textbf{M})\) is an atomic lattice and \(\textbf{K}\) has an independent quasi-equational basis relative to \(\textbf{M}\). Applications of these results for lattices, unary algebras, groups, unary algebras, and distributive algebras are presented which concern some well-known problems on standard topological quasivarieties and other problems.

In this paper we show the adequacy of tense logic with unary operators for dealing with finite trees. We prove that models on finite trees can be characterized by tense formulas, and describe an effective method to find an axiomatization of the theory of a given finite tree in tense logic. The strength of the characterization is shown by proving that adding the binary operators "Until" and "Since" to the language does not result in a better description than that given (...) by unary tense logic; although the greater expressive power of "Until" and "Since" can be exploited by using the semantics of e-frames instead of traditional Kripke semantics. (shrink)

We consider all combinatorially possible systems corresponding to subsets of finite set theory (i.e., Zermelo-Fraenkel set theory without the axiom of infinity) and for each of them either provide a well-founded locally finite graph that is a model of that theory or show that this is impossible. To that end, we develop the technique of _axiom closure of graphs_.

In this paper we prove that, for n > 1, the n-generated free algebra in any locally finite subvariety of HoRA can be written in a unique nontrivial way as Ł2 × A′, where A′ is a directly indecomposable algebra in . More precisely, we prove that the unique nontrivial pair of factor congruences of is given by the filters and , where the element is recursively defined from the term introduced by W. H. Cornish. As an additional result we (...) obtain a characterization of minimal irreducible filters of in terms of its coatoms. (shrink)

Mereology is the theory of the relation “being a part of”. The first exact formulation of mereology is due to the Polish logician Stanisław Leśniewski. But Leśniewski’s mereology is not first-order axiomatizable, for it requires every subset of the domain to have a fusion. In recent literature, a first-order theory named General Extensional Mereology can be thought of as a first-order approximation of Leśniewski’s theory, in the sense that GEM guarantees that every definable subset of the domain has a fusion, (...) and this has been achieved by positing an axiom schema which in effect defines infinitely many axioms. Intuitively, in order to range over every definable subset, such an axiom schema seems unavoidable. But this paper will show that GEM is finitely axiomatizable and that all we need are just finitely many instances of the said axiom schema. (shrink)

The aim of this paper is to highlight an individualist streak in both Davidson’s conception of language and Chomsky’s. In the first part of the paper, I argue that in Davidson’s case this individualist streak is a consequence of an excessively strong conception of what the compositional nature of linguistic meaning requires, and I offer a weaker conception of that requirement that can do justice to both the publicity and the compositionality of language. In the second part of the paper, (...) I offer a comparison between Davidson’s position on the unreality of public languages, and Chomsky’s position regarding the epiphenomenal status of “externalized” languages. In Chomsky’s case, as in Davidson’s, languages are individuated in terms of the formal theories that serve to account for their systematic structure, and this assumption rests upon a similarly strong and similarly questionable understanding of what it is to employ finite means in pursuit of an infinite task. The alternative, at which I can only hint, is a view of language as a social and historical reality, i.e., a realm of social fact that cannot be exhausted by any formal theory and cannot be reduced to properties of individual speakers. (shrink)

In this article, I develop the so‐called ‘problem of linguistic creativity’ for two object‐languages, one finite, the other infinite. I then employ an approach first outlined by Ludwig Wittgenstein’s collaborator Friedrich Waismann, to ‘dissolve’ that problem, in a sense made precise by working through the example. This is to unsettle the computational picture of linguistic understanding as turning on the generation of semantic information about sentences on the basis of semantic information about their constituent parts, and to provide a reasonably (...) clear conception of to what such ‘philosophical dissolution’ of a problem amounts. (shrink)

In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from (...) these classes have the finite model property with respect to the class of -formulae, i.e. each -formula has a -model iff it has a finite -model. Roughly speaking, a -formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators. (shrink)

Automated reasoning issues are addressed for a finite lattice-valued propositional logic LnP(X) with truth-values in a finite lattice-valued logical algebraic structure—lattice implication algebra. We investigate extended strategies and rules from classical logic to LnP(X) to simplify the procedure in the semantic level for testing the satisfiability of formulas in LnP(X) at a certain truth-value level α (α-satisfiability) while keeping the role of truth constant formula played in LnP(X). We propose a lock resolution method at a certain truth-value level α (α-lock (...) resolution) in LnP(X) and have proved its theorems of soundness and weak completeness, respectively. We provide more efficient resolution based automated reasoning in LnP(X) and key supports for α-resolution-based automated reasoning approaches and algorithms in lattice based linguistic truth-valued logic. (shrink)

There is no known syntactic characterization of the class of finite definitions in terms of a set of basic definitions and a set of basic operators under which the class is closed. Furthermore, it is known that the basic propositional operators do not preserve finiteness. In this paper I survey these problems and explore operators that do preserve finiteness. I also show that every definition that uses only unary predicate symbols and equality is bound to be finite.

We prove the Finite Model Property (FMP) for Distributive Full Lambek Calculus ( DFL ) whose algebraic semantics is the class of distributive residuated lattices ( DRL ). The problem was left open in [8, 5]. We use the method of nuclei and quasi–embedding in the style of [10, 1].

We show that the loosely guarded and packed fragments of first-order logic have the finite model property. We use a construction of Herwig and Hrushovski. We point out some consequences in temporal predicate logic and algebraic logic.

In this paper, we prove that Heyting's arithmetic can be interpreted in an intuitionistic version of Russell's Simple Theory of Types without extensionality.

Journal Name: Cognitive Linguistics Issue: Ahead of print.

This book aims to look at the semantics of natural languages in context.

We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes.

The “surge in use of finite-state methods” ([10]) in computational linguistics has largely, if not completely, left semantics untouched. The present paper is directed towards correcting this situation. Techniques explained in [1] are applied to a fragment of temporal semantics through an approach we call finite-state temporality. This proceeds from the intuition of an event as “a series of snapshots” ([15]; see also [12]), equating snapshots with symbols that collectively form our alphabet. A sequence of snapshots then becomes a (...) string over that alphabet, evoking comic/film strips. Jackendoff has, among others, objected to conceptualizing events in terms of snapshots ([8]). To counter these objections, we step up from events-as-strings to event-typesas-regular languages ([5, 6]), recognizing the need for variable granularity. Beyond the introduction of disjunction implicit in the step from a single string up to a set of strings, we obtain a useful logic from the regular operations and a careful choice of the snapshots (constituting our alphabet). (shrink)

Clark and Krauss [1977] presents a classification of complete, satisfiable and o-categorical theories in first order languages with finite non-logical vocabularies. In 1988 the first author modified this classification and raised three questions about the distribution of finitely axiomatizable theories. This paper answers two of those questions.

Today’s philosophical thinking mostly deals with the problem of sin from a religious, phenomenological or ethical point of view. This paper is an attempt to find hermeneutical points of view for the possibility of an interpretation of sin which can be opened by philosophical hermeneutics with reference to our historical being, the linguistic form of experience and the experience of finitude. The train of thoughts takes us from the analysis of the concept “original sin” to the disclosure of the speculative (...) structure and existential meaning of the original sin. Throughout this examination, the essence of original sin is revealed as the medium and the universal experience-horizon of the history of human being and of meaning. (shrink)

The technique of covers is now well established in semigroup theory. The idea is, given a semigroup S, to find a semigroup having a better understood structure than that of S, and an onto morphism of a specific kind from to S. With the right conditions on , the behaviour of S is closely linked to that of . If S is finite one aims to choose a finite . The celebrated results for inverse semigroups of McAlister in the 1970s (...) form the flagship of this theory.Weakly left quasi-ample semigroups form a quasivariety (of algebras of type(2, 1)), properly containing the classes of groups, and of inverse, left ample, and weakly left ample semigroups. We show how the existence of finite proper covers for semigroups in this quasivariety is a consequence of Ashs powerful theorem for pointlike sets. Our approach is to obtain a cover of a weakly left quasi-ample semigroup S as a subalgebra of S × G, where G is a group. It follows immediately from the fact that weakly left quasi-ample semigroups form a quasivariety, that is weakly left quasi-ample. We can then specialise our covering results to the quasivarieties of weakly left ample, and left ample semigroups. The latter have natural representations as (2, 1)-subalgebras of partial (one-one) transformations, where the unary operation takes a transformation to the identity map in the domain of . In the final part of this paper we consider representations of weakly left quasi-ample semigroups. (shrink)

We prove that every normal extension of the bi-modal system S52 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.

Motivated by a question of W. Rautenberg, we prove that any matrix that is term-equivalent to the well-known nonfinitely based matrix of A. Wroski is itself also nonfinitely based.

We exhibit a 10-element semigroup Q such that the question Does a given quasi-identity hold in Q? is co-NP-complete while the question Does a given identity hold in Q? can be answered in linear time.

An example of finite tree Mo is presented such that its predicate logic (i.e. the intermediate predicate logic characterized by the class of all predicate Kripke frames based on Mo) is not finitely axiomatizable. Hence it is shown that the predicate analogue of de Jongh - McKay - Hosoi's theorem on the finite axiomatizability of every finite intermediate propositional logic is not true.

An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.