Axiom schemes for m-valued functional calculi of first order. Part I. Definition of axiom schemes and proof of plausibility

1948 ◽  
Vol 13 (4) ◽  
pp. 177-192 ◽  
Author(s):  
J. B. Rosser ◽  
A. R. Turquette
Keyword(s):  
Truth Values ◽  
First Order ◽  
Order Part ◽  
Definition Of

A calculus, or its formalization, is m-valued when its truth-functions are allowed to take truth-values ranging from 1 through m. It is customary to divide the m truth-values that are possible into those that are “designated” and those that are “undesignated.” Furthermore, it is usually desired of a formalization that provable formulas and only provable formulas take designated truth-values exclusively. For our present purposes, we shall suppose that the truth-values 1, …, 8 are designated and the truth-values 8+1, …, m are undesignated. When calculi differ in respect to the number of their designated truth-values, we shall consider them different calculi, even if they are otherwise similar.

Axiom schemes for m-valued functional calculi of first order. Part II

1951 ◽  
Vol 16 (1) ◽  
pp. 22-34 ◽  
Author(s):  
J. B. Rosser ◽  
A. R. Turquette
Keyword(s):  
Analytic Formula ◽  
Truth Values ◽  
First Order ◽  
Order Part ◽  
Elegant Proof

In part I of the present paper axiom schemes and rules of inference were defined for m-valued functional calculi of first order with s(m > s > 1) designated truth-values. A proof of plausibility was given, and it was shown that it is not difficult to extend to m-valued functional calculi of first order certain concepts that are closely analogous to the ordinary 2-valued notions of “consistency with respect to an operator” and “absolute consistency.” The purpose of the present paper is to show that the concept of “deductive completeness” may be extended to m-valued functional calculi of first order. For this purpose we define “analytic formula” for the m-valued case and show that if a formula is analytic, then it is provable in our formalization of m-valued functional calculi of first order.In proving deductive completeness for the m-valued case, it is possible to use a method which is analogous to that used by Gödel in establishing the completeness of 2-valued functional calculi of first order. However, in the present paper we will indicate only very briefly how the Gödel procedure may be extended to the m-valued case. Our chief concern will be the problem of extending to our formalization of m-valued functional calculi the more elegant proof of deductive completeness for the 2-valued case which has recently been developed by Leon Henkin.

scholarly journals Off-Shell Noether Currents and Potentials for First-Order General Relativity

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 348
Author(s):  
Merced Montesinos ◽  
Diego Gonzalez ◽  
Rodrigo Romero ◽  
Mariano Celada
Keyword(s):  
General Relativity ◽  
Vector Fields ◽  
Killing Vector ◽  
Spherically Symmetric ◽  
Killing Vector Fields ◽  
Arbitrary Vector ◽  
Four Dimensions ◽  
First Order ◽  
Direct Form ◽  
Definition Of

We report off-shell Noether currents obtained from off-shell Noether potentials for first-order general relativity described by n-dimensional Palatini and Holst Lagrangians including the cosmological constant. These off-shell currents and potentials are achieved by using the corresponding Lagrangian and the off-shell Noether identities satisfied by diffeomorphisms generated by arbitrary vector fields, local SO(n) or SO(n−1,1) transformations, ‘improved diffeomorphisms’, and the ‘generalization of local translations’ of the orthonormal frame and the connection. A remarkable aspect of our approach is that we do not use Noether’s theorem in its direct form. By construction, the currents are off-shell conserved and lead naturally to the definition of off-shell Noether charges. We also study what we call the ‘half off-shell’ case for both Palatini and Holst Lagrangians. In particular, we find that the resulting diffeomorphism and local SO(3,1) or SO(4) off-shell Noether currents and potentials for the Holst Lagrangian generically depend on the Immirzi parameter, which holds even in the ‘half off-shell’ and on-shell cases. We also study Killing vector fields in the ‘half off-shell’ and on-shell cases. The current theoretical framework is illustrated for the ‘half off-shell’ case in static spherically symmetric and Friedmann–Lemaitre–Robertson–Walker spacetimes in four dimensions.

scholarly journals Solving puzzles in deformed JT gravity: phase transitions and non-perturbative effects

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Clifford V. Johnson ◽  
Felipe Rosso
Keyword(s):  
Phase Structure ◽  
Scalar Potential ◽  
String Equation ◽  
Two Dimensional ◽  
Leading Order ◽  
Classical Analysis ◽  
First Order ◽  
First Order Phase Transition ◽  
Definition Of ◽  
First Order Phase

Abstract Recent work has shown that certain deformations of the scalar potential in Jackiw-Teitelboim gravity can be written as double-scaled matrix models. However, some of the deformations exhibit an apparent breakdown of unitarity in the form of a negative spectral density at disc order. We show here that the source of the problem is the presence of a multi-valued solution of the leading order matrix model string equation. While for a class of deformations we fix the problem by identifying a first order phase transition, for others we show that the theory is both perturbatively and non-perturbatively inconsistent. Aspects of the phase structure of the deformations are mapped out, using methods known to supply a non-perturbative definition of undeformed JT gravity. Some features are in qualitative agreement with a semi-classical analysis of the phase structure of two-dimensional black holes in these deformed theories.

scholarly journals Formula size games for modal logic and μ-calculus

2019 ◽  
Vol 29 (8) ◽  
pp. 1311-1344 ◽  
Author(s):  
Lauri T Hella ◽  
Miikka S Vilander
Keyword(s):  
Modal Logic ◽  
Optimal Strategy ◽  
Order Logic ◽  
First Order Logic ◽  
Kripke Models ◽  
First Order ◽  
Modal Operators ◽  
Crucial Difference ◽  
Definition Of ◽  
Person Game

Abstract We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler–Immerman game. However, due to a crucial difference in the definition of positions of the game, its winning condition is simpler, and the second player does not have a trivial optimal strategy. Thus, unlike the Adler–Immerman game, our game is a genuine two-person game. We illustrate the use of the game by proving a non-elementary succinctness gap between bisimulation invariant first-order logic $\textrm{FO}$ and (basic) modal logic $\textrm{ML}$. We also present a version of the game for the modal $\mu $-calculus $\textrm{L}_\mu $ and show that $\textrm{FO}$ is also non-elementarily more succinct than $\textrm{L}_\mu $.

scholarly journals Macroscopic degeneracy and order in the 3D plaquette Ising model

2015 ◽  
Vol 29 (20) ◽  
pp. 1550109 ◽  
Author(s):  
Desmond A. Johnston ◽  
Marco Mueller ◽  
Wolfhard Janke
Keyword(s):  
Low Temperature ◽  
Magnetic Order ◽  
Finite Size ◽  
Temperature Phase ◽  
Finite Size Scaling ◽  
First Order ◽  
Magnetic Order Parameter ◽  
First Order Transition ◽  
Definition Of ◽  
Low Temperature Phase

The purely plaquette 3D Ising Hamiltonian with the spins living at the vertices of a cubic lattice displays several interesting features. The symmetries of the model lead to a macroscopic degeneracy of the low-temperature phase and prevent the definition of a standard magnetic order parameter. Consideration of the strongly anisotropic limit of the model suggests that a layered, “fuki-nuke” order still exists and we confirm this with multi-canonical simulations. The macroscopic degeneracy of the low-temperature phase also changes the finite-size scaling corrections at the first-order transition in the model and we see this must be taken into account when analyzing our measurements.

A TYPE-FREE THEORY OF HALF-MONOTONE INDUCTIVE DEFINITIONS

1995 ◽  
Vol 06 (03) ◽  
pp. 203-234 ◽  
Author(s):  
YUKIYOSHI KAMEYAMA
Keyword(s):  
Type Theory ◽  
Characteristic Point ◽  
Logical Theory ◽  
Inductive Definition ◽  
Program Extraction ◽  
First Order ◽  
Inductive Definitions ◽  
Free Theory ◽  
Program Proof ◽  
Definition Of

This paper studies an extension of inductive definitions in the context of a type-free theory. It is a kind of simultaneous inductive definition of two predicates where the defining formulas are monotone with respect to the first predicate, but not monotone with respect to the second predicate. We call this inductive definition half-monotone in analogy of Allen’s term half-positive. We can regard this definition as a variant of monotone inductive definitions by introducing a refined order between tuples of predicates. We give a general theory for half-monotone inductive definitions in a type-free first-order logic. We then give a realizability interpretation to our theory, and prove its soundness by extending Tatsuta’s technique. The mechanism of half-monotone inductive definitions is shown to be useful in interpreting many theories, including the Logical Theory of Constructions, and Martin-Löf’s Type Theory. We can also formalize the provability relation “a term p is a proof of a proposition P” naturally. As an application of this formalization, several techniques of program/proof-improvement can be formalized in our theory, and we can make use of this fact to develop programs in the paradigm of Constructive Programming. A characteristic point of our approach is that we can extract an optimization program since our theory enjoys the program extraction theorem.

Modelling spatial reasoning systems with shape algebras and formal logic

1997 ◽  
Vol 11 (4) ◽  
pp. 273-285 ◽  
Author(s):  
Scott C. Chase
Keyword(s):  
Spatial Reasoning ◽  
Predicate Logic ◽  
Spatial Relations ◽  
Large Set ◽  
First Order ◽  
Reasoning Systems ◽  
Geometric Objects ◽  
Small Set ◽  
Definition Of ◽  
High Level

AbstractThe combination of the paradigms of shape algebras and predicate logic representations, used in a new method for describing designs, is presented. First-order predicate logic provides a natural, intuitive way of representing shapes and spatial relations in the development of complete computer systems for reasoning about designs. Shape algebraic formalisms have advantages over more traditional representations of geometric objects. Here we illustrate the definition of a large set of high-level design relations from a small set of simple structures and spatial relations, with examples from the domains of geographic information systems and architecture.

scholarly journals First order normalization in the generalized photo gravitational non-planar restricted three body problems

2015 ◽  
Vol 3 (2) ◽  
pp. 46
Author(s):  
Nirbhay Kumar Sinha
Keyword(s):  
Oblate Spheroid ◽  
Second Order ◽  
Elliptic Motion ◽  
First Order ◽  
Short Period ◽  
Order Part ◽  
Three Body

<p>In this paper, we normalised the second-order part of the Hamiltonian of the problem. The problem is generalised in the sense that fewer massive primary is supposed to be an oblate spheroid. By photogravitational we mean that both primaries are radiating. With the help of Mathematica, H<sub>2</sub> is normalised to H<sub>2</sub> = a<sub>1</sub>b<sub>1</sub>w<sub>1</sub> + a<sub>2</sub>b<sub>2</sub>w<sub>2</sub>. The resulting motion is composed of elliptic motion with a short period (2p/w<sub>1</sub>), completed by an oscillation along the z-axis with a short period (2p/w<sub>2</sub>).</p>

Sign in / Sign up

Export Citation Format

Share Document