Pure first-order logics of quasiary predicates

2016 ◽  
pp. 073-086
Author(s):  
M.S. Nikitchenko ◽  
◽  
О.S. Shkilniak ◽  
S.S. Shkilniak ◽  
◽  
...  
Keyword(s):  
Logical Consequence ◽  
Quantifier Elimination ◽  
Consequence Relations ◽  
First Order ◽  
Semantic Models ◽  
Composition Algebras ◽  
Characteristic Features

Pure first-order logics of partial and total, single-valued and multi-valued quasiary predicates are investigated. For these logics we describe semantic models and languages, giving special attention in our research to composition algebras of predicates and interpretation classes (sematics), and logical consequence relations for sets of formulas. For the defined relations a number of sequent type calculi is constructed; their characteristic features are extended conditions for sequent closure and original forms for quantifier elimination.

Logical consequence relations in logics of monotone predicates and logics of antitone predicates

2017 ◽  
pp. 021-029
Author(s):  
O.S. Shkilniak ◽  
Keyword(s):  
Logical Consequence ◽  
Consequence Relations ◽  
Consequence Relation ◽  
First Order ◽  
Different Types ◽  
Composition Algebras

Logical consequence is one of the fundamental concepts in logic. In this paper we study logical consequence relations for program-oriented logical formalisms: pure first-order composition nominative logics of quasiary predicates. In our research we are giving special attention to different types of logical consequence relations in various semantics of logics of monotone predicates and logics of antitone predicates. For pure first-order logics of quasiary predicates we specify composition algebras of predicates, languages, interpretation classes (sematics) and logical consequence relations. We obtain the pairwise distinct relations: irrefutability consequence P |= IR , consequence on truth P |= T , consequence on falsity P |= F, strong consequence P |= TF in P-sеmantics of partial singlevalued predicates and strong consequence R |= TF in R-sеmantics of partial multi-valued predicates. Of the total of 20 of defined logical consequence relations in logics of monotone predicates and of antitone predicates, the following ones are pairwise distinct: PE |= IR, PE |= T, PE |= F, PE |= TF, RM |= T, RM |= F, RM |= TF. A number of examples showing the differences between various types of logical consequence relations is given. We summarize the results concerning the existence of a particular logical consequence relation for certain sets of formulas in a table and determine interrelations between different types of logical consequence relations.

Renominative logics with extended renomination, equality and predicate complement

2019 ◽  
Vol 24 (1-2) ◽  
pp. 34-48
Author(s):  
Nikitchenko M.S. ◽  
◽  
Shkilniak O.S. ◽  
Shkilniak S.S. ◽  
Mamedov T.A. ◽  
...  
Keyword(s):  
Logical Consequence ◽  
Consequence Relations ◽  
New Class ◽  
Composition Algebras ◽  
Semantic Properties

A new class of program-oriented logical formalisms is investigated – renominative logics with extended renominations, equality predicates, and predicate complement composition. Composition algebras and languages of such logics are described; their semantic properties are investigated. For these logics, a number of logical consequence relations are proposed and investigated, in particular, the logical consequence relations with undefinedness conditions. Properties of these relations form the semantic basis for further construction of sequent-type calculi for the proposed logics.

Sequent calculi of first-order logics of partial predicates with extended renominations and composition of predicate complement

2020 ◽  
pp. 182-197
Author(s):  
M.S. Nikitchenko ◽  
◽  
О.S. Shkilniak ◽  
S.S. Shkilniak ◽  
◽  
...  
Keyword(s):  
Existence Theorems ◽  
Logical Consequence ◽  
Consequence Relations ◽  
Sequent Calculi ◽  
First Order ◽  
Counter Model ◽  
Partial Predicates ◽  
Model Existence

We study new classes of program-oriented logical formalisms – pure first-order logics of quasiary predicates with extended renominations and a composition of predicate complement. For these logics, various logical consequence relations are specified and corresponding calculi of sequent type are constructed. We define basic sequent forms for the specified calculi and closeness conditions. The soundness, completeness, and counter-model existence theorems are proved for the introduced calculi.

scholarly journals Model Completeness, Uniform Interpolants and Superposition Calculus

2021 ◽  
Author(s):  
Diego Calvanese ◽  
Silvio Ghilardi ◽  
Alessandro Gianola ◽  
Marco Montali ◽  
Andrey Rivkin
Keyword(s):  
Automated Reasoning ◽  
Quantifier Elimination ◽  
Effective Solution ◽  
Model Completeness ◽  
Present Contribution ◽  
First Order ◽  
Reduction Strategies ◽  
Infinite State Systems ◽  
Infinite State ◽  
Superposition Calculus

AbstractUniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. This further research line is motivated by the fact that uniform interpolants offer an effective solution to tackle quantifier elimination and symbol elimination problems, which are central in model checking infinite state systems. This was first pointed out in ESOP 2008 by Gulwani and Musuvathi, and then by the authors of the present contribution in the context of recent applications to the verification of data-aware processes. In this paper, we show how covers are strictly related to model completions, a well-known topic in model theory. We also investigate the computation of covers within the Superposition Calculus, by adopting a constrained version of the calculus and by defining appropriate settings and reduction strategies. In addition, we show that computing covers is computationally tractable for the fragment of the language used when tackling the verification of data-aware processes. This observation is confirmed by analyzing the preliminary results obtained using the mcmt tool to verify relevant examples of data-aware processes. These examples can be found in the last version of the tool distribution.

scholarly journals A random first-order transition theory for an active glass

2018 ◽  
Vol 115 (30) ◽  
pp. 7688-7693 ◽  
Author(s):  
Saroj Kumar Nandi ◽  
Rituparno Mandal ◽  
Pranab Jyoti Bhuyan ◽  
Chandan Dasgupta ◽  
Madan Rao ◽  
...  
Keyword(s):  
Configurational Entropy ◽  
Simulation Models ◽  
Order Transition ◽  
Analytical Treatment ◽  
Apparent Contradiction ◽  
First Order ◽  
Active Particles ◽  
Propulsion Force ◽  
First Order Transition ◽  
Characteristic Features

How does nonequilibrium activity modify the approach to a glass? This is an important question, since many experiments reveal the near-glassy nature of the cell interior, remodeled by activity. However, different simulations of dense assemblies of active particles, parametrized by a self-propulsion force, f0, and persistence time, τp, appear to make contradictory predictions about the influence of activity on characteristic features of glass, such as fragility. This calls for a broad conceptual framework to understand active glasses; here, we extend the random first-order transition (RFOT) theory to a dense assembly of self-propelled particles. We compute the active contribution to the configurational entropy through an effective model of a single particle in a caging potential. This simple active extension of RFOT provides excellent quantitative fits to existing simulation results. We find that whereas f0 always inhibits glassiness, the effect of τp is more subtle and depends on the microscopic details of activity. In doing so, the theory automatically resolves the apparent contradiction between the simulation models. The theory also makes several testable predictions, which we verify by both existing and new simulation data, and should be viewed as a step toward a more rigorous analytical treatment of active glass.

What Would a Phenomenology of Logic Look Like?

Mind ◽  
2019 ◽  
Vol 129 (516) ◽  
pp. 1009-1031
Author(s):  
James Kinkaid
Keyword(s):  
Logical Consequence ◽  
Philosophy Of Logic ◽  
Contemporary Philosophy ◽  
Consequence Relations ◽  
Consequence Relation ◽  
If Logic ◽  
Pure Logic ◽  
Logical Investigations ◽  
Normative Status ◽  
Selection Of

Abstract The phenomenological movement begins in the Prolegomena to Husserl’s Logical Investigations as a philosophy of logic. Despite this, remarkably little attention has been paid to Husserl’s arguments in the Prolegomena in the contemporary philosophy of logic. In particular, the literature spawned by Gilbert Harman’s work on the normative status of logic is almost silent on Husserl’s contribution to this topic. I begin by raising a worry for Husserl’s conception of ‘pure logic’ similar to Harman’s challenge to explain the connection between logic and reasoning. If logic is the study of the forms of all possible theories, it will include the study of many logical consequence relations; by what criteria, then, should we select one (or a distinguished few) consequence relation(s) as correct? I consider how Husserl might respond to this worry by looking to his late account of the ‘genealogy of logic’ in connection with Gurwitsch’s claim that ‘[i]t is to prepredicative perceptual experience … that one must return for a radical clarification and for the definitive justification of logic’. Drawing also on Sartre and Heidegger, I consider how prepredicative experience might constrain or guide our selection of a logical consequence relation and our understanding of connectives like implication and negation.

Differentially algebraic group chunks

1990 ◽  
Vol 55 (3) ◽  
pp. 1138-1142 ◽  
Author(s):  
Anand Pillay
Keyword(s):  
Algebraic Group ◽  
Characteristic Zero ◽  
Quantifier Elimination ◽  
Closed Field ◽  
Zariski Topology ◽  
First Order ◽  
Differential Field ◽  
Closed Fields ◽  
Differential Fields ◽  
Algebraically Closed Fields

We point out that a group first order definable in a differentially closed field K of characteristic 0 can be definably equipped with the structure of a differentially algebraic group over K. This is a translation into the framework of differentially closed fields of what is known for groups definable in algebraically closed fields (Weil's theorem).I restrict myself here to showing (Theorem 20) how one can find a large “differentially algebraic group chunk” inside a group defined in a differentially closed field. The rest of the translation (Theorem 21) follows routinely, as in [B].What is, perhaps, of interest is that the proof proceeds at a completely general (soft) model theoretic level, once Facts 1–4 below are known.Fact 1. The theory of differentially closed fields of characteristic 0 is complete and has quantifier elimination in the language of differential fields (+, ·,0,1, −1,d).Fact 2. Affine n-space over a differentially closed field is a Noetherian space when equipped with the differential Zariski topology.Fact 3. If K is a differentially closed field, k ⊆ K a differential field, and a and are in k, then a is in the definable closure of k ◡ iff a ∈ ‹› (where k ‹› denotes the differential field generated by k and).Fact 4. The theory of differentially closed fields of characteristic zero is totally transcendental (in particular, stable).

scholarly journals KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS

2019 ◽  
Vol 84 (02) ◽  
pp. 533-588 ◽  
Author(s):  
STANISLAV KIKOT ◽  
AGI KURUCZ ◽  
YOSHIHITO TANAKA ◽  
FRANK WOLTER ◽  
MICHAEL ZAKHARYASCHEV
Keyword(s):  
Computer Science ◽  
Monotone Operators ◽  
Modal Logics ◽  
Consequence Relations ◽  
First Order ◽  
Completeness Problem ◽  
Relational Structures ◽  
Kripke Frames

AbstractOur concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same consequence relations for a given spi-logic.

More on definable sets of p-adic numbers

1988 ◽  
Vol 53 (3) ◽  
pp. 912-920 ◽  
Author(s):  
Philip Scowcroft
Keyword(s):  
Cross Section ◽  
Quantifier Elimination ◽  
Order Theory ◽  
Model Completeness ◽  
First Order ◽  
First Order Theory ◽  
Ordered Fields ◽  
Definable Sets ◽  
The Cross ◽  
Primitive Recursive

To eliminate quantifiers in the first-order theory of the p-adic field Qp, Ax and Kochen use a language containing a symbol for a cross-section map n → pn from the value group Z into Qp [1, pp. 48–49]. The primitive-recursive quantifier eliminations given by Cohen [2] and Weispfenning [10] also apply to a language mentioning the cross-section, but none of these authors seems entirely happy with his results. As Cohen says, “all the operations… introduced for our simple functions seem natural, with the possible exception of the map n → pn” [2, p. 146]. So all three authors show that various consequences of quantifier elimination—completeness, decidability, model-completeness—also hold for a theory of Qp not employing the cross-section [1, p. 453; 2, p. 146; 10, §4]. Macintyre directs a more specific complaint against the cross-section [5, p. 605]. Elementary formulae which use it can define infinite discrete subsets of Qp; yet infinite discrete subsets of R are not definable in the language of ordered fields, and so certain analogies between Qp and R suggested by previous model-theoretic work seem to break down.To avoid this problem, Macintyre gives up the cross-section and eliminates quantifiers in a theory of Qp written just in the usual language of fields supplemented by a predicate V for Qp's valuation ring and by predicates Pn for the sets of nth powers in Qp (for all n ≥ 2).

scholarly journals First-order modal logic in the necessary framework of objects

2016 ◽  
Vol 46 (4-5) ◽  
pp. 584-609 ◽  
Author(s):  
Peter Fritz
Keyword(s):  
Modal Logic ◽  
Model Theory ◽  
Consequence Relations ◽  
Possible World ◽  
Logical Constants ◽  
First Order ◽  
Timothy Williamson ◽  
Infinite Sets ◽  
Infinite Set ◽  
First Order Modal Logic

AbstractI consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He notes that only the cardinalities of these sets matters, and that not all pairs of infinite sets determine the same logic. I use so-called two-cardinal theorems from model theory to investigate the space of logics and consequence relations determined by pairs of infinite sets, and show how to eliminate the assumption that worlds are individuals from Williamson's argument.

Sign in / Sign up

Export Citation Format

Share Document