Results 21 to 30 of about 93,826 (250)
Modal Logic vs. Ontological Argument [PDF]
, 2012 The contemporary versions of the ontological argument that originated from Charles Hartshorne are formalized proofs based on unique modal theories. The simplest well-known theory of this kind arises from the b system of modal logic by adding two extra ...
Biłat, Andrezej
core +1 more source
Notes for a study of the didactic transposition of mathematical proof [PDF]
arXiv, 2023 It is nowadays common to consider that proof must be part of the learning of mathematics from Kindergarten to University1. As it is easy to observe, looking back to the history of mathematical curricula, this has not always been the case either because following an old pedagogical tradition of rote learning proof was reduced to the formalism of a text ...
arxiv
Fast Homotopy for Spacecraft Rendezvous Trajectory Optimization with Discrete Logic [PDF]
arXiv, 2021 This paper presents a computationally efficient optimization algorithm for solving nonconvex optimal control problems that involve discrete logic constraints. Traditional solution methods for these constraints require binary variables and mixed-integer programming, which is prohibitively slow and computationally expensive.
arxiv
Depth-Optimized Reversible Circuit Synthesis [PDF]
, 2012 In this paper, simultaneous reduction of circuit depth and synthesis cost of reversible circuits in quantum technologies with limited interaction is addressed.
Arabzadeh, Mona +3 more
core +1 more source
Les adaptations d’Ernest et Célestine ou comment détourner une création d’auteure
StrenaeIn 2012, the animated movie Ernest & Célestine was a public and critical success, as evidenced by its nomination for numerous international awards, including the 2013 César for Best Animated Film.
Christine Plu
doaj +1 more source
Multiset permutation generation by transpositions [PDF]
arXiv, 2023 This paper proposes a new algorithm for generating all permutations of multisets. The method uses transpositions only and adjacent transpositions are favoured. The algorithm requires a strong homogeneous transposition condition: non-adjacent transpositions are allowed only if all elements between the two permuted elements are equal to the smallest of ...
arxiv
The decision problem of modal product logics with a diagonal, and faulty counter machines [PDF]
, 2015 In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal') relation.
Hampson, Christopher +2 more
core +3 more sources
How To Do Things With Hohfeld [PDF]
, 2015 Wesley Newcomb Hohfeld’s 1913 article, Fundamental Legal Conceptions as Applied in Judicial Reasoning, is widely viewed as brilliant. A thrilling read, it is not. More like chewing on sawdust.
Schlag, Pierre
core +4 more sources
Quantum Complexity of Permutations [PDF]
arXiv, 2022 Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by $\sigma$ and $\tau$). In this article, we study quantum complexity of permutations in $S_n$ using $\{\sigma, \tau, \tau^{
arxiv
Logics of Imprecise Comparative Probability [PDF]
, 2021 This paper studies connections between two alternatives to the standard probability calculus for representing and reasoning about uncertainty: imprecise probability andcomparative probability.
Ding, Yifeng +2 more
core