Search results for "predicate logic"
showing 10 items of 170 documents
Monadic second-order logic over pictures and recognizability by tiling systems
1994
We show that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system if and only if it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and matches a natural logic. The proof is based on the Ehrenfeucht-FraIsse technique for first-order logic and an implementation of “threshold counting” within tiling systems.
Individuals, Identity, Names: Phenomenological Considerations
1997
In Husserl’s early writings (the Logical Investigations and the first section of Ideas I) the main concern of phenomenological investigations is the givenness of the ideal entities of logic and formal ontology. Another field in his earlier writings is the phenomenology of perception and time consciousness. This field of research broadens into the vision of a universal transcendental aesthetics, which, in his later writings, provides the basis for solving the problem of intersubjectivity.1 The final “synthesis” of these fields and problem domains is to be found in the phenomenological theory of the life-world. Lectures and research manuscripts2 of the late period show also that this second f…
Process specification and verification
1996
Graph grammars provide a very convenient specification tool for distributed systems of processes. This paper addresses the problem how properties of such specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.
Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems
1996
Abstract It is shown that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system iff it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and also matches a natural logic. The proof is based on the Ehrenfeucht–Fraisse technique for first-order logic and an implementation of “threshold counting” within tiling systems.
On the arithmetically Cohen-Macaulay property for sets of points in multiprojective spaces
2017
We study the arithmetically Cohen-Macaulay (ACM) property for finite sets of points in multiprojective spaces, especially ( P 1 ) n (\mathbb P^1)^n . A combinatorial characterization, the ( ⋆ ) (\star ) -property, is known in P 1 × P 1 \mathbb P^1 \times \mathbb P^1 . We propose a combinatorial property, ( ⋆ s ) (\star _s) with 2 ≤ s ≤ n 2\leq s\leq n , that directly generalizes the ( ⋆ ) (\star ) -property to ( P 1 ) n (\mathbb P^1)^n for larger n n . We show that X X is ACM if and only if it satisfies the ( ⋆ n ) (\star _n) -property. The main tool for several of our results is an extension to the multiprojective setting of certain liaison methods in projective space.
Hybrid coincidence and common fixed point theorems in Menger probabilistic metric spaces under a strict contractive condition with an application
2014
Abstract We prove some coincidence and common fixed point theorems for two hybrid pairs of mappings in Menger spaces satisfying a strict contractive condition. An illustrative example is given to support the genuineness of our extension besides deriving some related results. Then, we establish the corresponding common fixed point theorems in metric spaces. Finally, we utilize our main result to obtain the existence of a common solution for a system of Volterra type integral equations.
Weak commutation relations of unbounded operators: Nonlinear extensions
2013
We continue our analysis of the consequences of the commutation relation $[S,T]=\Id$, where $S$ and $T$ are two closable unbounded operators. The {\em weak} sense of this commutator is given in terms of the inner product of the Hilbert space $\H$ where the operators act. {We also consider what we call, adopting a physical terminology}, a {\em nonlinear} extension of the above commutation relations.
A New Extension of Darbo's Fixed Point Theorem Using Relatively Meir-Keeler Condensing Operators
2018
We consider relatively Meir–Keeler condensing operators to study the existence of best proximity points (pairs) by using the notion of measure of noncompactness, and extend a result of Aghajani et al. [‘Fixed point theorems for Meir–Keeler condensing operators via measure of noncompactness’, Acta Math. Sci. Ser. B35 (2015), 552–566]. As an application of our main result, we investigate the existence of an optimal solution for a system of integrodifferential equations.
Jeu de taquin and diamond cone for Lie (super)algebras
2015
Abstract In this paper, we recall combinatorial basis for shape and reduced shape algebras of the Lie algebras gl ( n ) , sp ( 2 n ) and so ( 2 n + 1 ) . They are given by semistandard and quasistandard tableaux. Then we generalize these constructions to the case of the Lie superalgebra spo ( 2 n , 2 m + 1 ) . The main tool is an extension of Schutzenberger's jeu de taquin to these algebras.
Weyl's Theorems and Extensions of Bounded Linear Operators
2012
A bounded operator $T\in L(X)$, $X$ a Banach space, is said to satisfy Weyl's theorem if the set of all spectral points that do not belong to the Weyl spectrum coincides with the set of all isolated points of the spectrum which are eigenvalues and having finite multiplicity. In this article we give sufficient conditions for which Weyl's theorem for an extension $\overline T$ of $T$ (respectively, for $T$) entails that Weyl's theorem holds for $T$ (respectively, for $\overline T$).