Premium
Some Solved and Unsolved Remainder Equations
Author(s) -
Hansson Sven Ove
Publication year - 1995
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19950410307
Subject(s) - remainder , mathematics , chinese remainder theorem , modulo , set (abstract data type) , element (criminal law) , discrete mathematics , combinatorics , arithmetic , computer science , law , political science , programming language
The remainder set A ⟂ B of a set of sentences A modulo a set of sentences B is the set of all maximal subsets of A not implying any element of B. A remainder equation is an expression containing remainder sets, such as { A } = B ⟂ X , in which at least one set is unknown. Solutions to some classes of remainder equations are reported, and some unsolved problems are listed.