80,873 research outputs found

    Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

    Get PDF
    At the core of the quest for a logic for Ptime is a mismatch between algorithms making arbitrary choices and isomorphism-invariant logics. One approach to tackle this problem is witnessed symmetric choice. It allows for choices from definable orbits certified by definable witnessing automorphisms. We consider the extension of fixed-point logic with counting (IFPC) with witnessed symmetric choice (IFPC+WSC) and a further extension with an interpretation operator (IFPC+WSC+I). The latter operator evaluates a subformula in the structure defined by an interpretation. When similarly extending pure fixed-point logic (IFP), IFP+WSC+I simulates counting which IFP+WSC fails to do. For IFPC+WSC, it is unknown whether the interpretation operator increases expressiveness and thus allows studying the relation between WSC and interpretations beyond counting. In this paper, we separate IFPC+WSC from IFPC+WSC+I by showing that IFPC+WSC is not closed under FO-interpretations. By the same argument, we answer an open question of Dawar and Richerby regarding non-witnessed symmetric choice in IFP. Additionally, we prove that nesting WSC-operators increases the expressiveness using the so-called CFI graphs. We show that if IFPC+WSC+I canonizes a particular class of base graphs, then it also canonizes the corresponding CFI graphs. This differs from various other logics, where CFI graphs provide difficult instances

    Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

    Full text link
    At the core of the quest for a logic for PTime is a mismatch between algorithms making arbitrary choices and isomorphism-invariant logics. One approach to overcome this problem is witnessed symmetric choice. It allows for choices from definable orbits which are certified by definable witnessing automorphisms. We consider the extension of fixed-point logic with counting (IFPC) with witnessed symmetric choice (IFPC+WSC) and a further extension with an interpretation operator (IFPC+WSC+I). The latter operator evaluates a subformula in the structure defined by an interpretation. This structure possibly has other automorphisms exploitable by the WSC-operator. For similar extensions of pure fixed-point logic (IFP) it is known that IFP+WSCI simulates counting which IFP+WSC fails to do. For IFPC+WSC it is unknown whether the interpretation operator increases expressiveness and thus allows studying the relation between WSC and interpretations beyond counting. We separate IFPC+WSC from IFPC+WSCI by showing that IFPC+WSC is not closed under FO-interpretations. By the same argument, we answer an open question of Dawar and Richerby regarding non-witnessed symmetric choice in IFP. Additionally, we prove that nesting WSC-operators increases the expressiveness using the so-called CFI graphs. We show that if IFPC+WSC+I canonizes a particular class of base graphs, then it also canonizes the corresponding CFI graphs. This differs from various other logics, where CFI graphs provide difficult instances.Comment: 46 pages, 5 figures, [v2] and [v3] Corrected minor mistakes and added figure

    Spin-Transfer-Torque Driven Magneto-Logic OR, AND and NOT Gates

    Full text link
    We show that current induced magneto-logic gates like AND, OR and NOT can be designed with the simple architecture involving a single nano spin-valve pillar, as an extension of our recent work on spin-torque-driven magneto-logic universal gates, NAND and NOR. Here the logical operation is induced by spin-polarized currents which also form the logical inputs. The operation is facilitated by the simultaneous presence of a constant controlling magnetic field, in the absence of which the same element operates as a magnetoresistive memory element. We construct the relevant phase space diagrams for the free layer magnetization dynamics in the monodomain approximation and show the rationale and functioning of the proposed gates. The flipping time for the logical states of these non-universal gates is estimated to be within nano seconds, just like their universal counter parts.Comment: 9 pages,7 figure

    Subspace-Invariant AC0^0 Formulas

    Full text link
    We consider the action of a linear subspace UU of {0,1}n\{0,1\}^n on the set of AC0^0 formulas with inputs labeled by literals in the set {X1,X‾1,…,Xn,X‾n}\{X_1,\overline X_1,\dots,X_n,\overline X_n\}, where an element u∈Uu \in U acts on formulas by transposing the iith pair of literals for all i∈[n]i \in [n] such that ui=1u_i=1. A formula is {\em UU-invariant} if it is fixed by this action. For example, there is a well-known recursive construction of depth d+1d+1 formulas of size O(n⋅2dn1/d)O(n{\cdot}2^{dn^{1/d}}) computing the nn-variable PARITY function; these formulas are easily seen to be PP-invariant where PP is the subspace of even-weight elements of {0,1}n\{0,1\}^n. In this paper we establish a nearly matching 2d(n1/d−1)2^{d(n^{1/d}-1)} lower bound on the PP-invariant depth d+1d+1 formula size of PARITY. Quantitatively this improves the best known Ω(2184d(n1/d−1))\Omega(2^{\frac{1}{84}d(n^{1/d}-1)}) lower bound for {\em unrestricted} depth d+1d+1 formulas, while avoiding the use of the switching lemma. More generally, for any linear subspaces U⊂VU \subset V, we show that if a Boolean function is UU-invariant and non-constant over VV, then its UU-invariant depth d+1d+1 formula size is at least 2d(m1/d−1)2^{d(m^{1/d}-1)} where mm is the minimum Hamming weight of a vector in U⊥∖V⊥U^\bot \setminus V^\bot

    CZF does not have the Existence Property

    Full text link
    Constructive theories usually have interesting metamathematical properties where explicit witnesses can be extracted from proofs of existential sentences. For relational theories, probably the most natural of these is the existence property, EP, sometimes referred to as the set existence property. This states that whenever (\exists x)\phi(x) is provable, there is a formula \chi(x) such that (\exists ! x)\phi(x) \wedge \chi(x) is provable. It has been known since the 80's that EP holds for some intuitionistic set theories and yet fails for IZF. Despite this, it has remained open until now whether EP holds for the most well known constructive set theory, CZF. In this paper we show that EP fails for CZF

    Inversion, Iteration, and the Art of Dual Wielding

    Full text link
    The humble †\dagger ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains). While these two operations are usually considered separately from one another, the emergence of reversible notions of computation shows the need to consider how the two ought to interact. In the present paper, we wield both of these daggers at once and consider dagger categories enriched in domains. We develop a notion of a monotone dagger structure as a dagger structure that is well behaved with respect to the enrichment, and show that such a structure leads to pleasant inversion properties of the fixed points that arise as a result. Notably, such a structure guarantees the existence of fixed point adjoints, which we show are intimately related to the conjugates arising from a canonical involutive monoidal structure in the enrichment. Finally, we relate the results to applications in the design and semantics of reversible programming languages.Comment: Accepted for RC 201

    Dependent choice, properness, and generic absoluteness

    Get PDF
    We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to -preserving symmetric submodels of forcing extensions. Hence, not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of large cardinals. We also investigate some basic consequences of the Proper Forcing Axiom in, and formulate a natural question about the generic absoluteness of the Proper Forcing Axiom in and. Our results confirm as a natural foundation for a significant portion of classical mathematics and provide support to the idea of this theory being also a natural foundation for a large part of set theory
    • …
    corecore