440 research outputs found
Ecumenical modal logic
The discussion about how to put together Gentzen's systems for classical and
intuitionistic logic in a single unified system is back in fashion. Indeed,
recently Prawitz and others have been discussing the so called Ecumenical
Systems, where connectives from these logics can co-exist in peace. In Prawitz'
system, the classical logician and the intuitionistic logician would share the
universal quantifier, conjunction, negation, and the constant for the absurd,
but they would each have their own existential quantifier, disjunction, and
implication, with different meanings. Prawitz' main idea is that these
different meanings are given by a semantical framework that can be accepted by
both parties. In a recent work, Ecumenical sequent calculi and a nested system
were presented, and some very interesting proof theoretical properties of the
systems were established. In this work we extend Prawitz' Ecumenical idea to
alethic K-modalities
Certified Knowledge Compilation with Application to Verified Model Counting
Computing many useful properties of Boolean formulas, such as their weighted or unweighted model count, is intractable on general representations. It can become tractable when formulas are expressed in a special form, such as the decision-decomposable, negation normal form (dec-DNNF) . Knowledge compilation is the process of converting a formula into such a form. Unfortunately existing knowledge compilers provide no guarantee that their output correctly represents the original formula, and therefore they cannot validate a model count, or any other computed value.
We present Partitioned-Operation Graphs (POGs), a form that can encode all of the representations used by existing knowledge compilers. We have designed CPOG, a framework that can express proofs of equivalence between a POG and a Boolean formula in conjunctive normal form (CNF).
We have developed a program that generates POG representations from dec-DNNF graphs produced by the state-of-the-art knowledge compiler D4, as well as checkable CPOG proofs certifying that the output POGs are equivalent to the input CNF formulas. Our toolchain for generating and verifying POGs scales to all but the largest graphs produced by D4 for formulas from a recent model counting competition. Additionally, we have developed a formally verified CPOG checker and model counter for POGs in the Lean 4 proof assistant. In doing so, we proved the soundness of our proof framework. These programs comprise the first formally verified toolchain for weighted and unweighted model counting
Provenance of north Gondwana Cambrian-Ordovician sandstone: U-Pb SHRIMP dating of detrital zircons from Israel and Jordan
A vast sequence of quartz-rich sandstone was deposited over North Africa and Arabia during Early Palaeozoic times, in the aftermath of Neoproterozoic Pan-African orogeny and the amalgamation of Gondwana. This rock sequence forms a relatively thin sheet (1–3 km thick) that was transported over a very gentle slope and deposited over a huge area. The sense of transport indicates unroofing of Gondwana terranes but the exact provenance of the siliciclastic deposit remains unclear. Detrital zircons from Cambrian arkoses that immediately overlie the Neoproterozoic Arabian–Nubian Shield in Israel and Jordan yielded Neoproterozoic U–Pb ages (900–530 Ma), suggesting derivation from a proximal source such as the Arabian–Nubian Shield. A minor fraction of earliest Neoproterozoic and older age zircons was also detected. Upward in the section, the proportion of old zircons increases and reaches a maximum (40%) in the Ordovician strata of Jordan. The major earliest Neoproterozoic and older age groups detected are 0.95–1.1, 1.8–1.9 and 2.65–2.7 Ga, among which the 0.95–1.1 Ga group is ubiquitous and makes up as much as 27% in the Ordovician of Jordan, indicating it is a prominent component of the detrital zircon age spectra of northeast Gondwana. The pattern of zircon ages obtained in the present work reflects progressive blanketing of the northern Arabian–Nubian Shield by Cambrian–Ordovician sediments and an increasing contribution from a more distal source, possibly south of the Arabian–Nubian Shield. The significant changes in the zircon age signal reflect many hundreds of kilometres of southward migration of the provenance
From Euclidean Geometry to Knots and Nets
This document is the Accepted Manuscript of an article accepted for publication in Synthese. Under embargo until 19 September 2018. The final publication is available at Springer via https://doi.org/10.1007/s11229-017-1558-x.This paper assumes the success of arguments against the view that informal mathematical proofs secure rational conviction in virtue of their relations with corresponding formal derivations. This assumption entails a need for an alternative account of the logic of informal mathematical proofs. Following examination of case studies by Manders, De Toffoli and Giardino, Leitgeb, Feferman and others, this paper proposes a framework for analysing those informal proofs that appeal to the perception or modification of diagrams or to the inspection or imaginative manipulation of mental models of mathematical phenomena. Proofs relying on diagrams can be rigorous if (a) it is easy to draw a diagram that shares or otherwise indicates the structure of the mathematical object, (b) the information thus displayed is not metrical and (c) it is possible to put the inferences into systematic mathematical relation with other mathematical inferential practices. Proofs that appeal to mental models can be rigorous if the mental models can be externalised as diagrammatic practice that satisfies these three conditions.Peer reviewe
Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers
We prove decidability of univariate real algebra extended with predicates for
rational and integer powers, i.e., and . Our decision procedure combines computation over real algebraic
cells with the rational root theorem and witness construction via algebraic
number density arguments.Comment: To appear in CADE-25: 25th International Conference on Automated
Deduction, 2015. Proceedings to be published by Springer-Verla
The Epsilon Calculus and Herbrand Complexity
Hilbert's epsilon-calculus is based on an extension of the language of
predicate logic by a term-forming operator . Two fundamental
results about the epsilon-calculus, the first and second epsilon theorem, play
a role similar to that which the cut-elimination theorem plays in sequent
calculus. In particular, Herbrand's Theorem is a consequence of the epsilon
theorems. The paper investigates the epsilon theorems and the complexity of the
elimination procedure underlying their proof, as well as the length of Herbrand
disjunctions of existential theorems obtained by this elimination procedure.Comment: 23 p
The "Artificial Mathematician" Objection: Exploring the (Im)possibility of Automating Mathematical Understanding
Reuben Hersh confided to us that, about forty years ago, the late Paul Cohen predicted to him that at some unspecified point in the future, mathematicians would be replaced by computers. Rather than focus on computers replacing mathematicians, however, our aim is to consider the (im)possibility of human mathematicians being joined by “artificial mathematicians” in the proving practice—not just as a method of inquiry but as a fellow inquirer
An Evolutionary Approach to Active Robust Multiobjective Optimisation
An Active Robust Optimisation Problem (AROP) aims at finding robust adaptable solutions, i.e. solutions that actively gain robustness to environmental changes through adaptation. Existing AROP studies have considered only a single performance objective. This study extends the Active Robust Optimisation methodology to deal with problems with more than one objective. Once multiple objectives are considered, the optimal performance for every uncertain parameter setting is a set of configurations, offering different trade-offs between the objectives. To evaluate and compare solutions to this type of problems, we suggest a robustness indicator that uses a scalarising function combining the main aims of multi-objective optimisation: proximity, diversity and pertinence. The Active Robust Multi-objective Optimisation Problem is formulated in this study, and an evolutionary algorithm that uses the hypervolume measure as a scalarasing function is suggested in order to solve it. Proof-of-concept results are demonstrated using a simplified gearbox optimisation problem for an uncertain load demand
Computational interpretations of analysis via products of selection functions
We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to two closely related infinite products of selection functions
- …