In (Anglberger et al., 2015, Section 4.1), a deontic logic is proposed which explicates the idea that a formula φ is obligatory if and only if it is (semantically speaking) the weakest permission. We give a sound and strongly complete, Hilbert style axiomatization for this logic. As a corollary, it is compact, contradicting earlier claims from Anglberger et al. (2015). In addition, we prove that our axiomatization is equivalent to Anglberger et al.’s infinitary proof system, and show that our results are robust w.r.t. certain changes in the underlying semantics.

We outline an intuitionistic view of knowledge which maintains the original Brouwer–Heyting–Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of verification. We argue that on this view coreflection A → KA is valid and the factivity of knowledge holds in the form KA → ¬¬A ‘known propositions cannot be false’.

We show that the traditional form of factivity KA → A is a distinctly classical principle which, like tertium non datur A ∨ ¬A, does not hold intuitionistically, but, along with the whole of classical epistemic logic, is intuitionistically valid in its double negation form ¬¬(KA ¬ A).

Within the intuitionistic epistemic framework the knowability paradox is resolved in a constructive manner. We argue that this paradox is the result of an unwarranted classical reading of constructive principles and as such does not have the consequences for constructive foundations traditionally attributed it.

We study cup products in the integral cohomology of the Hilbert scheme of $n$ points on a K3 surface and present a computer program for this purpose. In particular, we deal with the question of which classes can be represented by products of lower degrees.

Supplementary materials are available with this article.

Consider the first-order retarded differential equation

$$\begin{eqnarray}x^{\prime }(t)+p(t)x({\it\tau}(t))=0,\quad t\geqslant t_{0},\end{eqnarray}$$

$p(t)\geqslant 0$

${\it\tau}(t)$

${\it\tau}(t)\leqslant t$

$t\geqslant t_{0}$

$\lim _{t\rightarrow \infty }{\it\tau}(t)=\infty$

$\liminf$

$$\begin{eqnarray}\liminf _{t\rightarrow \infty }\int _{{\it\tau}(t)}^{t}p(s)\,ds>\frac{1}{e}\end{eqnarray}$$

We consider plane Cremona maps with proper base points and the base ideal generated by the linear system of forms defining the map. The object of this work is to study the link between the algebraic properties of the base ideal and those of the ideal of these points fattened by the virtual multiplicities arising from the linear system. We reveal conditions which naturally regulate this association, with particular emphasis on the homological side. While most classical numerical inequalities concern the three highest virtual multiplicities, here we emphasize also the role of one single highest multiplicity. In this vein we describe classes of Cremona maps for large and small values of the highest virtual multiplicity. We also deal with the delicate question as to when is the base ideal non-saturated and consider the structure of its saturation.

This paper, which was published on 3 November 2015, has been withdrawn.

The point-line collinearity graph ${\mathcal{G}}$ of the maximal 2-local geometry for the largest simple Fischer group, $Fi_{24}^{\prime }$, is extensively analysed. For an arbitrary vertex $a$ of ${\mathcal{G}}$, the $i\text{th}$-disc of $a$ is described in detail. As a consequence, it follows that ${\mathcal{G}}$ has diameter $5$. The collapsed adjacency matrix of ${\mathcal{G}}$ is given as well as accompanying computer files which contain a wealth of data about ${\mathcal{G}}$.

Supplementary materials are available with this article.

In recent years, Com–Poisson has emerged as one of the most popular discrete models in the analysis of count data owing to its flexibility in handling different types of dispersion. However, in a stationary longitudinal Com–Poisson count data set-up where the covariates are time independent, estimation of regression and dispersion parameters based on a generalized quasi-likelihood (GQL) approach involves some major computational difficulties particularly in the inversion of the joint covariance matrix. On the other hand, in practical real-life longitudinal studies, time-dependent covariates leading to non-stationary responses are more frequently encountered. This implies that further computational problems will now arise when estimating parameters under non-stationary set-ups. This paper overcomes this problem by approximating the inverse of the ill-conditioned covariance matrix in the GQL approach through a multidimensional conjugate gradient method. The performance of this novel version of the GQL approach is then assessed on simulations of AR(1) stationary and AR(1) non-stationary longitudinal Com–Poisson counts and on real-life epileptic seizure counts. However, there is not yet an algorithm to generate non-stationary longitudinal Com–Poisson counts nor a GQL algorithm to estimate the parameters under non-stationary set-ups. Thus, the paper also provides a framework to generate non-stationary AR(1) Com–Poisson counts along with the construction of a GQL equation under non-stationary set-ups.

Peirce considered the principal business of logic to be the analysis of reasoning. He argued that the diagrammatic system of Existential Graphs, which he had invented in 1896, carries the logical analysis of reasoning to the furthest point possible. The present paper investigates the analytic virtues of the Alpha part of the system, which corresponds to the sentential calculus. We examine Peirce’s proposal that the relation of illation is the primitive relation of logic and defend the view that this idea constitutes the fundamental motive of philosophy of notation both in algebraic and graphical logic. We explain how in his algebras and graphs Peirce arrived at a unifying notation for logical constants that represent both truth-function and scope. Finally, we show that Shin’s argument for multiple readings of Alpha graphs is circular.

We construct four binary consequence systems axiomatizing entailment relations between formulas of classical, intuitionistic, dual-intuitionistic and modal (S4) logics, respectively. It is shown that the intuitionistic consequence system is embeddable in the modal (S4) one by the usual modal translation prefixing □ to every subformula of the translated formula. An analogous modal translation of dual-intuitionistic formulas then consists of prefixing ◊ to every subformula of the translated formula. The philosophical importance of this result is briefly discussed.

Inferentialism claims that the rules for the use of an expression express its meaning without any need to invoke meanings or denotations for them. Logical inferentialism endorses inferentialism specifically for the logical constants. Harmonic inferentialism, as the term is introduced here, usually but not necessarily a subbranch of logical inferentialism, follows Gentzen in proposing that it is the introduction-rules which give expressions their meaning and the elimination-rules should accord harmoniously with the meaning so given. It is proposed here that the logical expressions are those which can be given schematic rules that lie in a specific sort of harmony, general-elimination (ge) harmony, resulting from applying a certain operation, the ge-procedure, to produce ge-rules in accord with the meaning defined by the I-rules. Griffiths (2014) claims that identity cannot be given such rules, concluding that logical inferentialists are committed to ruling identity a nonlogical expression. It is shown that the schematic rules for identity given in Read (2004), slightly amended, are indeed ge-harmonious, so confirming that identity is a logical notion.

We define and study quasidialectical systems, which are an extension of Magari’s dialectical systems, designed to make Magari’s formalization of trial and error mathematics more adherent to the real mathematical practice of revision: our proposed extension follows, and in several regards makes more precise, varieties of empiricist positions à la Lakatos. We prove several properties of quasidialectical systems and of the sets that they represent, called quasidialectical sets. In particular, we prove that the quasidialectical sets are ${\rm{\Delta }}_2^0$ sets in the arithmetical hierarchy. We distinguish between “loopless” quasidialectal systems, and quasidialectical systems “with loops”. The latter ones represent exactly those coinfinite c.e. sets, that are not simple. In a subsequent paper we will show that whereas the dialectical sets are ω-c.e., the quasidialectical sets spread out throughout all classes of the Ershov hierarchy of the ${\rm{\Delta }}_2^0$ sets.

If $S$ is a quintic surface in $\mathbb{P}^{3}$ with singular set 15 3-divisible ordinary cusps, then there is a Galois triple cover ${\it\phi}:X\rightarrow S$ branched only at the cusps such that $p_{g}(X)=4$, $q(X)=0$, $K_{X}^{2}=15$ and ${\it\phi}$ is the canonical map of $X$. We use computer algebra to search for such quintics having a free action of $\mathbb{Z}_{5}$, so that $X/\mathbb{Z}_{5}$ is a smooth minimal surface of general type with $p_{g}=0$ and $K^{2}=3$. We find two different quintics, one of which is the van der Geer–Zagier quintic; the other is new.

We also construct a quintic threefold passing through the 15 singular lines of the Igusa quartic, with 15 cuspidal lines there. By taking tangent hyperplane sections, we compute quintic surfaces with singular sets $17\mathsf{A}_{2}$, $16\mathsf{A}_{2}$, $15\mathsf{A}_{2}+\mathsf{A}_{3}$ and $15\mathsf{A}_{2}+\mathsf{D}_{4}$.

This article considers the positive integers $N$ for which ${\it\zeta}_{N}(s)=\sum _{n=1}^{N}n^{-s}$ has zeroes in the half-plane $\Re (s)>1$. Building on earlier results, we show that there are no zeroes for $1\leqslant N\leqslant 18$ and for $N=20,21,28$. For all other $N$ there are infinitely many such zeroes.

We present several formal theories for the arithmetic of the even and the odd, show that the irrationality of $\sqrt 2$ can be proved in one of them, that the proof must involve contradiction, and prove that the irrationality of $\sqrt {17}$ cannot be proved inside any formal theory of the even and the odd.

Causal models defined in terms of structural equations have proved to be quite a powerful way of representing knowledge regarding causality. However, a number of authors have given examples that seem to show that the Halpern–Pearl (HP) definition of causality (Halpern & Pearl, 2005) gives intuitively unreasonable answers. Here it is shown that, for each of these examples, we can give two stories consistent with the description in the example, such that intuitions regarding causality are quite different for each story. By adding additional variables, we can disambiguate the stories. Moreover, in the resulting causal models, the HP definition of causality gives the intuitively correct answer. It is also shown that, by adding extra variables, a modification to the original HP definition made to deal with an example of Hopkins & Pearl (2003) may not be necessary. Given how much can be done by adding extra variables, there might be a concern that the notion of causality is somewhat unstable. Can adding extra variables in a “conservative” way (i.e., maintaining all the relations between the variables in the original model) cause the answer to the question “Is X = x a cause of Y = y?” to alternate between “yes” and “no”? It is shown that we can have such alternation infinitely often, but if we take normality into consideration, we cannot. Indeed, under appropriate normality assumptions. Adding an extra variable can change the answer from “yes’ to “no”, but after that, it cannot change back to “yes”.

The aim of the discrete logarithm problem with auxiliary inputs is to solve for ${\it\alpha}$, given the elements $g,g^{{\it\alpha}},\ldots ,g^{{\it\alpha}^{d}}$ of a cyclic group $G=\langle g\rangle$, of prime order $p$. The best-known algorithm, proposed by Cheon in 2006, solves for ${\it\alpha}$ in the case where $d\mid (p\pm 1)$, with a running time of $O(\sqrt{p/d}+d^{i})$ group exponentiations ($i=1$ or $1/2$ depending on the sign). There have been several attempts to generalize this algorithm to the case of ${\rm\Phi}_{k}(p)$ where $k\geqslant 3$. However, it has been shown by Kim, Cheon and Lee that a better complexity cannot be achieved than that of the usual square root algorithms.

We propose a new algorithm for solving the DLPwAI. We show that this algorithm has a running time of $\widetilde{O}(\sqrt{p/{\it\tau}_{f}}+d)$ group exponentiations, where ${\it\tau}_{f}$ is the number of absolutely irreducible factors of $f(x)-f(y)$. We note that this number is always smaller than $\widetilde{O}(p^{1/2})$.

In addition, we present an analysis of a non-uniform birthday problem.

We prove that every integer $n\geqslant 10$ such that $n\not \equiv 1\text{ mod }4$ can be written as the sum of the square of a prime and a square-free number. This makes explicit a theorem of Erdős that every sufficiently large integer of this type may be written in such a way. Our proof requires us to construct new explicit results for primes in arithmetic progressions. As such, we use the second author’s numerical computation regarding the generalised Riemann hypothesis to extend the explicit bounds of Ramaré–Rumely.