From finitary to infinitary second‐order logic

A back and forth condition on interpretations for those second‐order languages without functional variables whose non‐logical vocabulary is finite and excludes functional constants is presented. It is shown that this condition is necessary and sufficient for the interpretations to be equivalent in the language. When applied to second‐order languages with an infinite non‐logical vocabulary, excluding functional constants, the back and forth condition is sufficient but not necessary. It is shown that there is a class of infinitary second‐order languages whose non‐logical vocabulary is infinite for which the back and forth condition is both necessary and sufficient. It is also shown that some applications of the back and forth construction for second‐order languages can be extended to the infinitary second‐order languages. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Extended Curry‐Howard terms for second‐order logic

In order to allow the use of axioms in a second‐order system of extracting programs from proofs, we define constant terms, a form of Curry‐Howard terms, whose types are intended to correspond to those axioms. We also define new reduction rules for these new terms so that all consequences of the axioms can be represented. We finally show that the extended Curry‐Howard terms are strongly normalizable.     

Sperner spaces and first‐order logic

We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo‐elementary class, it is not elementary nor even ??_∞ω‐axiomatizable. We also axiomatize the first‐order theory of this class.     

Non‐self‐adjoint singular second‐order dynamic operators on time scale

In this study, maximal dissipative second‐order dynamic operators on semi‐infinite time scale are studied in the Hilbert space , that the extensions of a minimal symmetric operator in limit‐point case. We construct a self‐adjoint dilation of the dissipative operator together with its incoming and outgoing spectral representations so that we can determine the scattering function of the dilation as stated in the scheme of Lax‐Phillips. Moreover, we construct a functional model of the dissipative operator and identify its characteristic function in terms of the Weyl‐Titchmarsh function of a self‐adjoint second‐order dynamic operator. Finally, we prove the theorems on completeness of the system of root functions of the dissipative and accumulative dynamic operators.     

Modal‐type orthomodular logic

In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripkestyle semantic founded on Baer*‐semigroups as in [22] (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on dual‐intuitionistic logic

Dual‐intuitionistic logics are logics proposed by Czermak (1977), Goodman (1981) and Urbas (1996). It is shown in this paper that there is a correspondence between Goodman's dual‐intuitionistic logic and Nelson's constructive logic N^?.     

Algebraization of the Three‐valued BCK‐logic

In this paper a definition of n‐valued system in the context of the algebraizable logics is proposed. We define and study the variety V₃, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three‐valued BCK‐logic”. As a consequence we find an axiomatic definition of the above system.     

Local computation in linear logic

This work deals with the exponential fragment of Girard's linear logic ([3]) without the contraction rule, a logical system which has a natural relation with the direct logic ([10], [7]). A new sequent calculus for this logic is presented in order to remove the weakening rule and recover its behavior via a special treatment of the propositional constants, so that the process of cut-elimination can be performed using only “local” reductions. Hence a typed calculus, which admits only local rewriting rules, can be introduced in a natural manner. Its main properties — normalizability and confluence — has been investigated; moreover this calculus has been proved to satisfy a Curry-Howard isomorphism ([6]) with respect to the logical system in question. MSC: 03B40, 03F05.     

Fraenkel‐Carnap properties

In the 1920's Fraenkel and Carnap raised the question of whether or not every finitely axiomatizable semantically complete theory formulated in the theory of types is categorical. Partial answers to this and a related question are presented for theories formulated in second‐order logic. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on the first‐order logic of complete BL‐chains

In [10] it is claimed that the set of predicate tautologies of all complete BL‐chains and the set of all standard tautologies (i. e., the set of predicate formulas valid in all standard BL‐algebras) coincide. As noticed in [11], this claim is wrong. In this paper we show that a complete BL‐chain B satisfies all standard BL‐tautologies iff for any transfinite sequence (a_i: i ∈ I) of elements of B , the condition ∧_{i ∈ I} (a²_i ) = (∧_{i ∈ I} a_i)² holds in B . (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Glivenko like theorems in natural expansions of BCK‐logic

The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK‐logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK‐logic with negation by a family of connectives implicitly defined by equations and compatible with BCK‐congruences. Many of the logics in the current literature are natural expansions of BCK‐logic with negation. The validity of the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one‐variable formula in the language of BCK‐logic with negation. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Fraenkel‐Carnap question for Dedekind algebras

It is shown that the second‐order theory of a Dedekind algebra is categorical if it is finitely axiomatizable. This provides a partial answer to an old and neglected question of Fraenkel and Carnap: whether every finitely axiomatizable semantically complete second‐order theory is categorical. It follows that the second‐order theory of a Dedekind algebra is finitely axiomatizable iff the algebra is finitely characterizable. It is also shown that the second‐order theory of a Dedekind algebra is quasi‐finitely axiomatizable iff the algebra is quasi‐finitely characterizable.     

A second‐order finite difference approximation for a mathematical model of erythropoiesis

We present a second‐order finite difference scheme for approximating solutions of a mathematical model of erythropoiesis, which consists of two nonlinear partial differential equations and one nonlinear ordinary differential equation. We show that the scheme achieves second‐order accuracy for smooth solutions. We compare this scheme to a previously developed first‐order method and show that the first order method requires significantly more computational time to provide solutions with similar accuracy. We also compare this numerical scheme with other well‐known second‐order methods and show that it has better capability in approximating discontinuous solutions. Finally, we present an application to recovery after blood loss. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Kripke‐Platek Set Theory and the Anti‐Foundation Axiom

The paper investigates the strength of the Anti‐Foundation Axiom, AFA, on the basis of Kripke‐Platek set theory without Foundation. It is shown that the addition of AFA considerably increases the proof theoretic strength.     

Non‐isolated quasi‐degrees

We show that non‐isolated from below 2‐c.e. Q ‐degrees are dense in the structure of c.e. Q ‐degrees. We construct a 2‐c.e. Q ‐degree, which can't be isolated from below not only by c.e. Q ‐degrees, but by any Q ‐degree. We also prove that below any c.e. Q ‐degree there is a 2‐c.e. Q ‐degree, which is non‐isolated from below and from above (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Second‐order Galerkin‐Lagrange method for the Navier‐Stokes equations (retracted article)

It has come to the attention of the editors and publisher that an article published in Numerical Methods and Partial Differential Equations, “Second‐order Galerkin‐Lagrange method for the Navier‐Stokes equations,” by Mohamed Bensaada, Driss Esselaoui, and Pierre Saramito, Numer Methods Partial Differential Eq 21(6) (2005), 1099–1121 included large portions that were copied from the following paper without proper citation: “Convergence and nonlinear stability of the Lagrange‐Galerkin method for the Navier‐Stokes equations,” Endre Suli, Numerische Mathematik, Vol. 53, No. 4, pp. 459–486 (July, 1988). We have retracted the paper and apologize to Dr. Suli Numer Methods Partial Differential Eq (2007)23(1)211 .     

Time‐weighted blow‐up rates and pointwise profile for single‐point blow‐up solutions in reaction–diffusion equations

This paper deals with asymptotic behavior for blow‐up solutions to time‐weighted reaction–diffusion equations u_t=Δu+e^αtv^p and v_t=Δv+e^βtu^q, subject to homogeneous Dirichlet boundary. The time‐weighted blow‐up rates are defined and obtained by ways of the scaling or auxiliary‐function methods for all α, . Aiding by key inequalities between components of solutions, we give lower pointwise blow‐up profiles for single‐point blow‐up solutions. We also study the solutions of the system with variable exponents instead of constant ones, where blow‐up rates and new blow‐up versus global existence criteria are obtained. Time‐weighted functions influence critical Fujita exponent, critical Fujita coefficient and formulae of blow‐up rates, but they do not limit the order of time‐weighted blow‐up rates and pointwise profile near blow‐up time. Copyright © 2017 John Wiley & Sons, Ltd.     

The expressive power of k-ary exclusion logic

In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds exclusion logic is equivalent with dependence logic. By observing the translations, we see that the expressive power of EXC[k] lies in between k-ary and ($k+1$)-ary dependence logics. We will show that, at least in the case when $k=1$, both of these inclusions are proper.In a recent work by the author it was shown that k-ary inclusion-exclusion logic is equivalent with k-ary existential second order logic, ESO[k]. We will show that, on the level of sentences, it is possible to simulate inclusion atoms with exclusion atoms, and in this way express ESO[k]-sentences by using only k-ary exclusion atoms. For this translation we also need to introduce a novel method for “unifying” the values of certain variables in a team. As a consequence, EXC[k] captures ESO[k] on the level of sentences, and we obtain a strict arity hierarchy for exclusion logic. It also follows that k-ary inclusion logic is strictly weaker than EXC[k].Finally we use similar techniques to formulate a translation from ESO[k] to k-ary inclusion logic with an alternative strict semantics. Consequently, for any arity fragment of inclusion logic, strict semantics is strictly more expressive than lax semantics.     

Convergence analysis for second‐order accurate schemes for the periodic nonlocal Allen‐Cahn and Cahn‐Hilliard equations

In this paper, we provide a detailed convergence analysis for fully discrete second‐order (in both time and space) numerical schemes for nonlocal Allen‐Cahn and nonlocal Cahn‐Hilliard equations. The unconditional unique solvability and energy stability ensures ? ⁴ stability. The convergence analysis for the nonlocal Allen‐Cahn equation follows the standard procedure of consistency and stability estimate for the numerical error function. For the nonlocal Cahn‐Hilliard equation, because of the complicated form of the nonlinear term, a careful expansion of its discrete gradient is undertaken, and an H ^?1 inner‐product estimate of this nonlinear numerical error is derived to establish convergence. In addition, an a priori bound of the numerical solution at the discrete level is needed in the error estimate. Such a bound can be obtained by performing a higher order consistency analysis by using asymptotic expansions for the numerical solution. Following the technique originally proposed by Strang (eg, 1964), instead of the standard comparison between the exact and numerical solutions, an error estimate between the numerical solution and the constructed approximate solution yields an O (s ³+h ⁴) convergence in norm, in which s and h denote the time step and spatial mesh sizes, respectively. This in turn leads to the necessary bound under a standard constraint s ≤C h . Here, we also prove convergence of the scheme in the maximum norm under the same constraint.