Powerset Residuated Algebras and Generalized Lambek Calculus

We prove a representation theorem for (abstract) residuated algebras: each residuated algebra is isomorphically embeddable into a powerset residuated algebra. As a consequence, we obtain a completeness theorem for the Generalized Lambek Calculus. We use a Labelled Deductive System which generalizes the one used by Buszkowski [4] and Pankrat'ev [17] in completeness theorems for the Lambek Calculus.     

Derivability of admissible rules with simple premises in the Lambek calculus

A method for proving the fact that any admissible in the basic Lambek calculus L rule with a premise consisting of a finite number of simple (i.e., not containing connectives) sequents is derivable is described in the paper.     

Frame definability in finitely valued modal logics

In this paper we study frame definability in finitely valued modal logics and establish two main results via suitable translations: (1) in finitely valued modal logics one cannot define more classes of frames than are already definable in classical modal logic (cf. [27, Thm. 8]), and (2) a large family of finitely valued modal logics define exactly the same classes of frames as classical modal logic (including modal logics based on finite Heyting and MV-algebras, or even BL-algebras). In this way one may observe, for example, that the celebrated Goldblatt–Thomason theorem applies immediately to these logics. In particular, we obtain the central result from [26] with a much simpler proof and answer one of the open questions left in that paper. Moreover, the proposed translations allow us to determine the computational complexity of a big class of finitely valued modal logics.     

Softness of hypercoherences and MALL full completeness

We prove a full completeness theorem for multiplicative–additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard’s *-autonomous category of hypercoherences. This is the first non-game-theoretic full completeness theorem for this fragment. Our main result is that every dinatural transformation between definable functors arises from the denotation of a cut-free MALL proof.Our proof consists of three steps. We show:

• •Dinatural transformations on this category satisfy Joyal’s softness property for products and coproducts.
• •Softness, together with multiplicative full completeness, guarantees that every dinatural transformation corresponds to a Girard MALL proof-structure.
• •The proof-structure associated with any dinatural transformation is a MALL proof-net, hence a denotation of a proof. This last step involves a detailed study of cycles in additive proof-structures.

The second step is a completely general result, while the third step relies on the concrete structure of a double gluing construction over hypercoherences.     

Proof and refutation in MALL as a game

We present a setting in which the search for a proof of B or a refutation of B (i.e., a proof of ¬B) can be carried out simultaneously: in contrast, the usual approach in automated deduction views proving B or proving ¬B as two, possibly unrelated, activities. Our approach to proof and refutation is described as a two-player game in which each player follows the same rules. A winning strategy translates to a proof of the formula and a counter-winning strategy translates to a refutation of the formula. The game is described for multiplicative and additive linear logic (MALL). A game theoretic treatment of the multiplicative connectives is intricate and our approach to it involves two important ingredients. First, labeled graph structures are used to represent positions in a game and, second, the game playing must deal with the failure of a given player and with an appropriate resumption of play. This latter ingredient accounts for the fact that neither player might win (that is, neither B nor ¬B might be provable).     

Softness of MALL proof-structures and a correctness criterion with Mix

We show that every MALL proof-structure [9] satisfies the property of softness, originally a categorical notion introduced by Joyal. Furthermore, we show that the notion of hereditary softness precisely captures Girards algebraic restriction of the technical condition on proof-structures. Relying on this characterization, we prove a MALL+Mix sequentialization theorem by a proof-theoretical method, using Girards notion of jump. Our MALL+Mix correctness criterion subsumes the Danos/Fleury-Retoré criterion [6] for MLL+Mix.This work was supported by Grant-in-Aid for Young Scientists of Ministry of Education, Science and Culture of Japan.Mathematics Subject Classification (2000):03F52, 03F07, 03F03Revised version: 9 August 2003     

On Finite Model Property for Admissible Rules

Our investigation is concerned with the finite model property (fmp) with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown (Theorem 4.3) that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics (which is equipotent to all these λ extend a certain subframe logic defined over S4 by omission of four special frames) have fmp w.r.t. admissibility.     

Signed Langford sequences

We answer a question of Brown and Jordon (2021) [4] by proving the existence of signed Langford sequences of every possible order for each defect. Our proof is constructive, and the constructions are shown to have other interesting properties and connections to several conjectures concerning permutations and partial sums of sequences of elements from cyclic groups.     

Weyl型代数的环论性质

设A是代数闭域k上有单位元1的交换结合代数，D是A的交换κ-导子组成的非零k-向量空间，苏育才与赵开明引进Weyl型代数A[D]并且证明了结合代数A[D]是单代数当且仅当A是D-单的且k1[D]在A上的作用为忠实的,通过证明A[D]与smash product A#U(D)同构，我们给出了这一结果的一个纯环论的证明，同时给出了A[D]的一个Ore扩张实现。     

Sequent systems for compact bilinear logic

Compact Bilinear Logic (CBL), introduced by Lambek [14], arises from the multiplicative fragment of Noncommutative Linear Logic of Abrusci [1] (also called Bilinear Logic in [13]) by identifying times with par and 0 with 1. In this paper, we present two sequent systems for CBL and prove the cut‐elimination theorem for them. We also discuss a connection between cut‐elimination for CBL and the Switching Lemma from [14].     

Graded left modular lattices are supersolvable

We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-labellings in [MT] by combining results of McNamara [Mc] and Liu [Li]. As part of our proof, we show that the maximum graded quotient of the free product of a chain and a single-element lattice is finite and distributive.Received May 24, 2004; accepted in final form October 12, 2004.     

Explicit maximal and minimal curves over finite fields of odd characteristics

In this work we present explicit classes of maximal and minimal Artin–Schreier type curves over finite fields having odd characteristics. Our results include the proof of Conjecture 5.9 given in [1] as a very special subcase. We use some techniques developed in [2], which were not used in [1].     

Ideal-Symmetric and Semiprime Rings

Lambek extended the usual commutative ideal theory to ideals in noncommutative rings, calling an ideal A of a ring R symmetric if rst ∈ A implies rts ∈ A for r, s, t ∈ R. R is usually called symmetric if 0 is a symmetric ideal. This naturally gives rise to extending the study of symmetric ring property to the lattice of ideals. In the process, we introduce the concept of an ideal-symmetric ring. We first characterize the class of ideal-symmetric rings and show that this ideal-symmetric property is Morita invariant. We provide a method of constructing an ideal-symmetric ring (but not semiprime) from any given semiprime ring, noting that semiprime rings are ideal-symmetric. We investigate the structure of minimal ideal-symmetric rings completely, finding two kinds of basic forms of finite ideal-symmetric rings. It is also shown that the ideal-symmetric property can go up to right quotient rings in relation with regular elements. The polynomial ring R[x] over an ideal-symmetric ring R need not be ideal-symmetric, but it is shown that the factor ring R[x]/xⁿR[x] is ideal-symmetric over a semiprime ring R.     

Tits form numbers

We define the relative Tits form number W(G, V) of a valued bigraph G at a vertex v and derive some basic properties. We give a detailed analysis of the case when W (G,V) ≥½. The properties of these numbers were used without proof in the classification of Auslander algebras of finite representation type [IPTZ]     

Proof schemes combined: mapping secondary students’ multi-faceted and evolving first encounters with mathematical proof

In this paper, we propose an enriched and extended application of Harel and Sowder’s proof schemes taxonomy that can be used as a diagnostic tool for characterizing secondary students’ emergent learning of proof and proving. We illustrate this application in the analysis of data collected from 85 Year 9 (age 14–15) secondary students. We capture these students’ first encounters with proof and proving in an educational context (mixed ability, state schools in Greece) where mathematical proof is explicitly present in algebra and geometry lessons and where proving skills are typically expected, and rewarded, in key national examinations. We analyze student written responses to six questions, soon after the students had been introduced to proof and we identify evidence of six of the seven proof schemes proposed by Harel and Sowder as well as a further eight combinations of the six. We observed these combinations often within the response of the same student and to the same item. Here, we illustrate the eight combinations and we claim that a dynamic use of the proof schemes taxonomy that encompasses sole and combined proof schemes is a potent theoretical and pedagogical tool for mapping students’ multi-faceted and evolving competence in, and appreciation for, proof and proving.     

A functional central limit theorem for diffusions on periodic submanifolds of ℝ N

We prove a functional central limit theorem for diffusions on periodic sub- manifolds of ℝ^N. The proof is an adaptation of a method presented in [BenLioPap] and [Bha] for proving functional central limit theorems for diffusions with periodic drift vectorfields. We then apply the central limit theorem in order to obtain a recurrence and a transience criterion for periodic diffusions. Other fields of applications could be heat-kernel estimates, similar to the ones obtained in [Lot].Mathematics Subject Classification (2000): 35B27, 60F05, 58J65The author wants to express his gratitude toward the National Cheng Kung University in Tainan (Taiwan) for its kind hospitality.     

Geometries with dual affine planes and symplectic quadrics

Farmer and Hale [3] prove that every copolar space fully embedded in a finite projective space PG(n, q), with q>, is the copolar space arising from a symplectic polarity. We show that this result is still valid in arbitrary projective spaces; this provides a different and shorter proof of [3] in the finite case.     

Counterexamples on some articles on quasi-variational inclusion problems

In this paper, by counterexamples, we show that Proposition 3.1 in [5] which has a crucial role for proving the main results is not correct. Also, we give counterexamples, which show that some claims in the proof of the main results in [7, 12] are not valid. Finally, by applying some slightly modifications, we claim that these results can be proved in a similar manner.     

One more proof of the Borodin-Okounkov formula for Toeplitz determinants

Recently, Borodin and Okounkov [2] established a remarkable identity for Toeplitz determinants. Two other proofs of this identity were subsequently found by Basor and Widom [1], who also extended the formula to the block case. We here give one more proof, also for the block case. This proof is based on a formula for the inverse of a finite block Toeplitz matrix obtained in the late seventies by Silbermann and the author.     

Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback

In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a.v.ch.f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding error probability. The proof makes use of a new method ([1]) to prove the coding theorem for discrete memoryless channels with noiseless feedback (d.m.c.f.). It was emphasized in [1] that the method is not based on random coding or maximal coding ideas, and it is this fact that makes it particularly suited for proving coding theorems for certain systems of channels with noiseless feedback.As a consequence of our results we obtain a formula for the zero-error capacity of a d.m.c.f., which was conjectured by Shannon ([8], p. 19).