Now showing items 1-20 of 272

    • Automorphisms of models of set theory and extensions of NFU

      McKenzie, Zachiri; University of Gothenburg (Elsevier, 2015-01-05)
      In this paper we exploit the structural properties of standard and non-standard models of set theory to produce models of set theory admitting automorphisms that are well-behaved along an initial segment of their ordinals. NFU is Ronald Jensen's modification of Quine's ‘New Foundations’ Set Theory that allows non-sets (urelements) into the domain of discourse. The axioms AxCount, AxCount≤ and AxCount≥ each extend NFU by placing restrictions on the cardinality of a finite set of singletons relative to the cardinality of its union. Using the results about automorphisms of models of subsystems of set theory we separate the consistency strengths of these three extensions of NFU. More specifically, we show that NFU+AxCount proves the consistency of NFU+AxCount≤, and NFU+AxCount≤ proves the consistency of NFU+AxCount≥.
    • Decidable fragments of the simple theory of types with infinity and NF

      Dawar, Anuj; Forster, Thomas; McKenzie, Zachiri; University of Cambridge (Duke University PressUniversity of Notre Dame, 2017-04-21)
      We identify complete fragments of the simple theory of types with infinity (TSTI) and Quine's new foundations (NF) set theory. We show that TSTI decides every sentence φ in the language of type theory that is in one of the following forms: (A) φ = ∀x r11 ⋯ ∀xrkk ∃ys11 ⋯ ∃ys11 θ where the superscripts denote the types of the variables, s1 > ⋯ > s1, and θ is quantifier-free, (B) φ = ∀x r11 ⋯ ∀xrkk ∃ys11 ⋯ ∃ys11 θ where the superscripts denote the types of the variables and θ is quantifier-free. This shows that NF decides every stratified sentence φ in the language of set theory that is in one of the following forms: (A′) φ = ∀x1 ⋯ ∀xk ∃y1 ⋯ ∃yl θ where θ is quantifier-free and φ admits a stratification that assigns distinct values to all of the variables y1,⋯, yl, (B′) φ = ∀x1 ⋯ ∀xk ∃y1 ⋯ ∃yl θ where θ is quantifier-free and <p admits a stratification that assigns the same value to all of the variables y1,⋯, yl.
    • On the relative strengths of fragments of collection

      McKenzie, Zachiri; University of Michigan-Shanghai Jiao Tong University Joint Institute (WileyWiley-VCH Verlag, 2019-05-02)
      Let M be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, Δ0-separation and set foundation. This paper studies the relative strength of set theories obtained by adding fragments of the set-theoretic collection scheme to M. We focus on two common parameterisations of the collection: -collection, which is the usual collection scheme restricted to -formulae, and strong -collection, which is equivalent to -collection plus -separation. The main result of this paper shows that for all , 1. M + proves that there exists a transitive model of Zermelo Set Theory plus -collection, 2. the theory M + is -conservative over the theory M + strong . It is also shown that (2) holds for when the Axiom of Choice is included in the base theory. The final section indicates how the proofs of (1) and (2) can be modified to obtain analogues of these results for theories obtained by adding fragments of collection to a base theory (Kripke-Platek Set Theory with Infinity plus V=L) that does not include the powerset axiom.
    • Initial self-embeddings of models of set theory

      Enayat, Ali; McKenzie, Zachiri; University of Gothenburg; Zhejiang University (Cambridge University PressAssociation for Symbolic Logic, 2021-08-13)
      By a classical theorem of Harvey Friedman (1973), every countable nonstandard model MM of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of MM such that j[M]⊊Mj[M]⊊M , and the ordinal rank of each member of j[M]j[M] is less than the ordinal rank of each element of M∖j[M]M∖j[M] . Here, we investigate the larger family of proper initial-embeddings j of models MM of fragments of set theory, where the image of j is a transitive submodel of MM . Our results include the following three theorems. In what follows, ZF−ZF− is ZFZF without the power set axiom; WOWO is the axiom stating that every set can be well-ordered; WF(M)WF(M) is the well-founded part of MM ; and Π1∞-DCαΠ∞1-DCα is the full scheme of dependent choice of length αα . Theorem A. There is an ωω -standard countable nonstandard model MM of ZF−+WOZF−+WO that carries no initial self-embedding j:M⟶Mj:M⟶M other than the identity embedding. Theorem B. Every countable ωω -nonstandard model MM of ZF ZF is isomorphic to a transitive submodel of the hereditarily countable sets of its own constructible universe LMLM . Theorem C. The following three conditions are equivalent for a countable nonstandard model MM of ZF−+WO+∀α Π1∞-DCαZF−+WO+∀α Π∞1-DCα . 1. (I) There is a cardinal in MM that is a strict upper bound for the cardinality of each member of WF(M)WF(M) . 2. (II) WF(M)WF(M) satisfies the powerset axiom. 3. (III) For all n∈ωn∈ω and for all b∈Mb∈M , there exists a proper initial self-embedding j:M⟶Mj:M⟶M such that b∈rng(j)b∈rng(j) and j[M]≺nMj[M]≺nM .
    • End extending models of set theory via power admissible covers

      McKenzie, Zachiri; Enayat, Ali; University of Gothenburg (Elsevier, 2022-04-15)
      Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented by Barwise as a versatile tool for generalising model-theoretic results about countable well-founded models of set theory to countable ill-founded ones. Our development of the power admissible machinery allows us to obtain new results concerning powerset-preserving end extensions and rank extensions of countable models of subsystems of ZFC . The canonical extension KP P of Kripke-Platek set theory KP plays a key role in our work; one of our results refines a theorem of Rathjen by showing that Σ 1 P -Foundation is provable in KP P (without invoking the axiom of choice).
    • On the strength of a weak variant of the axiom of counting

      McKenzie, Zachiri; University of Gothenburg (WileyWiley-VCH Verlag, 2017-03-24)
      In this paper NFU-AC is used to denote Jensen's modification of Quine's ‘new foundations’ set theory (NF) fortified with a type-level pairing function but without the axiom of choice. The axiom AxCount>_ is the variant of the axiom of counting which asserts that no finite set is smaller than its own set of singletons. This paper shows that NFU-AC + AxCount>_ proves the consistency of the simple theory of types with infinity (TSTI). This result implies that NF + AxCount>_ proves that consistency of TSTI, and that NFU-AC + AxCount>_ proves the consistency of NFU-AC.
    • Largest initial segments pointwise fixed by automorphisms of models of set theory

      Enayat, Ali; Kaufmann, Matt; McKenzie, Zachiri; Gothenburg University; University of Texas at Austin (Springer, 2017-09-12)
      Given a model M of set theory, and a nontrivial automorphism j of M, let Ifix(j) be the submodel of M whose universe consists of elements m of M such that j(x)=x for every x in the transitive closure of m (where the transitive closure of m is computed within M). Here we study the class C of structures of the form Ifix(j), where the ambient model M satisfies a frugal yet robust fragment of ZFC known as MOST, and j(m)=m whenever m is a finite ordinal in the sense of M. Our main achievement is the calculation of the theory of C as precisely MOST+Δ0P Collection. The following theorems encapsulate our principal results: Theorem A. Every structure inC satisfies MOST+Δ0P Collection. Theorem B. Each of the following three conditions is sufficient for a countable structure (a) N is a transitive model of MOST+Δ0P Collection. (b) N is a recursively saturated model of MOST+Δ0P Collection. (c) N is a model of ZFC. Theorem C. Suppose M is a countable recursively saturated model of ZFC and I is a proper initial segment of OrdM that is closed under exponentiation and contains ωM. There is a group embedding j⟼j from Aut(Q) into Aut(M) such that I is the longest initial segment of OrdM that is pointwise fixed by jˇ for every nontrivial j∈Aut(Q). In Theorem C, Aut(X) is the group of automorphisms of the structure X, and Q is the ordered set of rationals.
    • Feferman’s forays into the foundations of category theory

      Enayat, Ali; Gorbow, Paul; McKenzie, Zachiri; Jäger, Gerhard; Sieg, Wilfried; University of Gothenburg (Springer, 2018-04-02)
      This paper is primarily concerned with assessing a set-theoretical system, S*, for the foundations of category theory suggested by Solomon Feferman. S* is an extension of NFU, and may be seen as an attempt to accommodate unrestricted categories such as the category of all groups (without any small/large restrictions), while still obtaining the benefits of ZFC on part of the domain. A substantial part of the paper is devoted to establishing an improved upper bound on the consistency strength of S*. The assessment of S* as a foundation of category theory is framed by the following general desiderata (R) and (S). (R) asks for the unrestricted existence of the category of all groups, the category of all categories, the category of all functors between two categories, etc., along with natural implementability of ordinary mathematics and category theory. (S) asks for a certain relative distinction between large and small sets, and the requirement that they both enjoy the full benefits of the ZFC axioms. S* satisfies (R) simply because it is an extension of NFU. By means of a recursive construction utilizing the notion of strongly cantorian sets, we argue that it also satisfies (S). Moreover, this construction yields a lower bound on the consistency strength of S*. We also exhibit a basic positive result for category theory internal to NFU that provides motivation for studying NFU-based foundations of category theory.
    • Iterated ultrapowers for the masses

      Enayat, Ali; Kaufmann, Matt; McKenzie, Zachiri; University of Gothenburg; University of Texas at Austin; University of Chester (Springer, 2017-10-05)
      We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown to provide smooth proofs of several results in general model theory.
    • L1 scheme for semilinear stochastic subdiffusion with integrated fractional Gaussian noise

      Wu, Xiaolei; Yan, Yubin; Lyuliang University; University of Chester (MDPI, 2025-03-12)
      This paper considers a numerical method for solving the stochastic semilinear subdiffusion equation which is driven by integrated fractional Gaussian noise and the Hurst parameter H∈(1/2,1). The finite element method is employed for spatial discretization, while the L1 scheme and Lubich’s first-order convolution quadrature formula are used to approximate the Caputo time-fractional derivative of order α∈(0,1) and the Riemann–Liouville time-fractional integral of order γ∈(0,1), respectively. Using the semigroup approach, we establish the temporal and spatial regularity of the mild solution to the problem. The fully discrete solution is expressed as a convolution of a piecewise constant function with the inverse Laplace transform of a resolvent-related function. Based on the Laplace transform method and resolvent estimates, we prove that the proposed numerical scheme has the optimal convergence order O(τmin{H+α+γ−1−ε,α}),ε&gt;0. Numerical experiments are presented to validate these theoretical convergence orders and demonstrate the effectiveness of this method.
    • A fractional Adams method for Caputo fractional differential equations with modified graded meshes

      Yang, Yuhui; Yan, Yubin; Lyuliang University; University of Chester (MDPI, 2025-03-06)
      In this paper, we introduce an Adams-type predictor–corrector method based on a modified graded mesh for solving Caputo fractional differential equations. This method not only effectively handles the weak singularity near the initial point but also reduces errors associated with large intervals in traditional graded meshes. We prove the error estimates in detail for both 0&lt;α&lt;1 and 1&lt;α&lt;2 cases, where α is the order of the Caputo fractional derivative. Numerical experiments confirm the convergence of the proposed method and compare its performance with the traditional graded mesh approach.
    • Turing instability of a discrete competitive single diffusion-driven Lotka–Volterra model

      Wen, Mingyao; Zhang, Guang; Yan, Yubin; South China Agricultural University; University of Chester (Elsevier, 2025-02-22)
      This paper develops a discrete competitive Lotka–Volterra system with single diffusion under Neumann boundary conditions. It establishes the conditions for Turing instability and identifies the precise Turing bifurcation when the diffusion coefficient is used as a bifurcation parameter. Within Turing unstable regions, a variety of Turing patterns are explored via numerical simulations, encompassing lattice, nematode, auspicious cloud, spiral wave, polygon, and stripe patterns, as well as their combinations. The periodicity and complexity of these patterns are verified through bifurcation simulations, Lyapunov exponent analysis, trajectory or phase diagrams. These methods are also applicable to other single diffusion systems, including partial dissipation systems.
    • Error analysis for semilinear stochastic subdiffusion with integrated fractional Gaussian noise

      Wu, Xiaolei; Yan, Yubin; Lvliang University; University of Chester (MDPI, 2024-11-15)
      We analyze the error estimates of a fully discrete scheme for solving a semilinear stochastic subdiffusion problem driven by integrated fractional Gaussian noise with a Hurst parameter H∈(0,1). The covariance operator Q of the stochastic fractional Wiener process satisfies ∥A−ρQ1/2∥HS &lt; ∞ for some ρ∈[0,1), where ∥·∥HS denotes the Hilbert–Schmidt norm. The Caputo fractional derivative and Riemann–Liouville fractional integral are approximated using Lubich’s convolution quadrature formulas, while the noise is discretized via the Euler method. For the spatial derivative, we use the spectral Galerkin method. The approximate solution of the fully discrete scheme is represented as a convolution between a piecewise constant function and the inverse Laplace transform of a resolvent-related function. By using this convolution-based representation and applying the Burkholder–Davis–Gundy inequality for fractional Gaussian noise, we derive the optimal convergence rates for the proposed fully discrete scheme. Numerical experiments confirm that the computed results are consistent with the theoretical findings.
    • Correction of a High-Order Numerical Method for Approximating Time-Fractional Wave Equation

      Ramezani, Mohadese; Mokhtari, Reza; Yan, Yubin; Isfahan University of Technology; University of Chester (Springer, 2024-07-22)
      A high-order time discretization scheme to approximate the time-fractional wave equation with the Caputo fractional derivative of order $\alpha \in (1, 2)$ is studied. We establish a high-order formula for approximating the Caputo fractional derivative of order $\alpha \in (1, 2)$. Based on this approximation, we propose a novel numerical method to solve the time-fractional wave equation. Remarkably, this method corrects only one starting step and demonstrates second-order convergence in both homogeneous and inhomogeneous cases, regardless of whether the data is smooth or nonsmooth. We also analyze the stability region associated with the proposed numerical method. Some numerical examples are given to elucidate the convergence analysis.
    • Mathematical modelling of problems with delay and after-effect

      Ford, Neville; University of Chester (Elsevier, 2024-10-17)
      This paper provides a tutorial review of the use of delay differential equations in mathematical models of real problems. We use the COVID-19 pandemic as an example to help explain our conclusions. We present the fundamental delay differential equation as a prototype for modelling problems where there is a delay or after-effect, and we reveal (via the characteristic values) the infinite dimensional nature of the equation and the presence of oscillatory solutions not seen in corresponding equations without delay. We discuss how models were constructed for the COVID-19 pandemic, particularly in view of the relative lack of understanding of the disease and the paucity of available data in the early stages, and we identify both strengths and weaknesses in the modelling predictions and how they were communicated and applied. We consider the question of whether equations with delay could have been or should have been utilised at various stages in order to make more accurate or more useful predictions.
    • Analysis of a Reaction-Diffusion Model Towards Description and Prediction of Breast Cancer Progression

      Kavallaris, Nikos; Yan, Yubin; Zeyadeh, Majduleen M. M. (University of Chester, 2024-09-23)
      This thesis conducts a thorough investigation by combining mathematical analysis, empirical clinical data, and meticulous clinical observations to investigate the tumour dynamics which are controlled by two crucial biomarkers: cancerous cells (CK7) and active T-cells (CD4). Introducing a reaction-diffusion model facilitates the spatial and temporal distribution of the biomarkers CK7 and CD4. Subsequently, explore the stability, bifurcation and sensitivity analyses to show the effects of critical biological parameters on tumour dynamics. An exploration of the travelling wave solutions of the model, through numerical methods, aids in the visualisation of the dynamic behaviour of the system, particularly the invasion of the CK7 population towards the CD4 population. Employing a numerical approach, specifically utilising the finite volume method, provides a clear representation of the dynamic interplay within the tumour environment. Our analysis contributes not only to a heightened theoretical understanding but also holds potential implications for therapeutic decisions in tumour dynamics. Hence, our investigation shows efficacy not only in predicting tumour dynamics but also in providing a robust framework to present specific clinical observations.
    • Extremal binary self-dual codes from a bordered four circulant construction

      Gildea, Joe; Korban, Adrian; Roberts, Adam; Tylyshchak, Alexander; Dundalk Institute of Technology; University of Chester; Ferenc Rakoczi II Transcarpathian Hungarian College of Higher Education (Elsevier, 2023-03-23)
      In this paper, we present a new bordered construction for self-dual codes which employs λ-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring of characteristic 2. Moreover, using our bordered construction together with the well-known building-up and neighbour methods, we construct many binary self-dual codes of lengths 56, 62, 78, 92 and 94 with parameters in their weight enumerators that were not known in the literature before.
    • New binary self-dual codes of lengths 80, 84 and 96 from composite matrices

      Gildea, Joe; Korban, Adrian; Roberts, Adam; University of Chester (Springer, 2021-12-19)
      In this work, we apply the idea of composite matrices arising from group rings to derive a number of different techniques for constructing self-dual codes over finite commutative Frobenius rings. By applying these techniques over different alphabets, we construct best known singly-even binary self-dual codes of lengths 80, 84 and 96 as well as doubly-even binary self-dual codes of length 96 that were not known in the literature before.
    • Self-dual codes from a block matrix construction characterised by group rings

      Roberts, Adam; University of Chester (Springer, 2024-02-22)
      We give a new technique for constructing self-dual codes based on a block matrix whose blocks arise from group rings and orthogonal matrices. The technique can be used to construct self-dual codes over finite commutative Frobenius rings of characteristic 2. We give and prove the necessary conditions needed for the technique to produce self-dual codes. We also establish the connection between self-dual codes generated by the new technique and units in group rings. Using the construction together with the building-up construction, we obtain new extremal binary self-dual codes of lengths 64, 66 and 68 and new best known binary self-dual codes of length 80.
    • Quaternary Hermitian self-dual codes of lengths 26, 32, 36, 38 and 40 from modifications of well-known circulant constructions

      Roberts, Adam; University of Chester (Springer, 2022-12-22)
      In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory automorphism using λ-circulant matrices. The new constructions are derived as modifications of various well-known circulant constructions of self-dual codes. Applying these constructions together with the building-up construction, we construct many new best known quaternary Hermitian self-dual codes of lengths 26, 32, 36, 38 and 40.