‎In this paper‎, ‎we investigate a damped Korteweg-de‎ ‎Vries equation with forcing on a periodic domain‎ ‎$mathbb{T}=mathbb{R}/(2pimathbb{Z})$‎. ‎We can obtain that if the‎ ‎forcing is periodic with small amplitude‎, ‎then the solution becomes‎ ‎eventually time-periodic.

Wagner 10] introduced the Integer Circuit Evaluation problem. Informally , the problem concerns a circuit that takes singleton sets, each containing one integer, and combines them using three types of set operations: The problem is to determine whether the set output by the circuit contains a particular integer. In this paper we show that the Integer Circuit problem is PSPACE-complete, resolvin...

For a connected graph G = (V,E) of order at least two, a total detour monophonic set of a graph G is a detour monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total detour monophonic set of G is the total detour monophonic number of G and is denoted by dmt(G). A subset T of a minimum total detour monophonic set S of G is a forcing total...

Uncountable superperfect forcing is tree forcing on regular uncountable cardinals κ with κ<κ = κ , using trees in which the heights of nodes that split along any branch in the tree form a club set, and such that any node in the tree with more than one immediate extension has measure-one-many extensions, where the measure is relative to some κ-complete, nonprincipal normal filter (or p-filter) F...

Let us denote by Cκ the standard Cohen algebra of π-weight κ, i.e. the complete Boolean algebra adjoining κ Cohen reals, where κ is an infinite cardinal or 0. More generally, we call a Boolean algebra A a Cohen algebra if (for technical convenience in Theorems 0.3 and 0.4 below) it satisfies the countable chain condition and forcing with A (more precisely with the partial ordering A \ {0}) is e...

A vertex set D in graph G is called a geodetic set if all vertices of G are lying on some shortest u–v path of G, where u, v 2 D. The geodetic number of a graph G is the minimum cardinality among all geodetic sets. A subset S of a geodetic set D is called a forcing subset of D if D is the unique geodetic set containing S. The forcing geodetic number of D is the minimum cardinality of a forcing ...

A certain approach to paraconsistency was initiated by works of R. Jennings and P. Schotch. In their “Inference and necessity” [4] they proposed a notion of a level of inconsistency (incoherence) of a given set of premises. This level is a measure that assigns to a given set of premises X, the least number of elements of covers of X that consist of consistent subsets of X. The idea of the level...